{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:L3BMP2QXELKWWNR62H6VZACSFB","short_pith_number":"pith:L3BMP2QX","canonical_record":{"source":{"id":"1110.1144","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-06T03:16:43Z","cross_cats_sorted":[],"title_canon_sha256":"351fecfbb315a87af7b04b6baa1b2ae7ef3cbc29ce2b106e71f437bf06cc30c0","abstract_canon_sha256":"57d2728ea0b7a531395bc1fc6018f4f7a342f78a7b3ac7d130d38a54dedb1707"},"schema_version":"1.0"},"canonical_sha256":"5ec2c7ea1722d56b363ed1fd5c8052285f492a6956646b6c0dde72f262ad7a6d","source":{"kind":"arxiv","id":"1110.1144","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1144","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1144v3","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1144","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"L3BMP2QXELKW","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L3BMP2QXELKWWNR6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L3BMP2QX","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:L3BMP2QXELKWWNR62H6VZACSFB","target":"record","payload":{"canonical_record":{"source":{"id":"1110.1144","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-06T03:16:43Z","cross_cats_sorted":[],"title_canon_sha256":"351fecfbb315a87af7b04b6baa1b2ae7ef3cbc29ce2b106e71f437bf06cc30c0","abstract_canon_sha256":"57d2728ea0b7a531395bc1fc6018f4f7a342f78a7b3ac7d130d38a54dedb1707"},"schema_version":"1.0"},"canonical_sha256":"5ec2c7ea1722d56b363ed1fd5c8052285f492a6956646b6c0dde72f262ad7a6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:53.473105Z","signature_b64":"tPkjYR0LLPJuzAYOVZ4to3d56KpciF1wWzb0dwzITyuAhHCrapH2BARaLFkx5l3r+JZ728V8nKFZV8bnLeR0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ec2c7ea1722d56b363ed1fd5c8052285f492a6956646b6c0dde72f262ad7a6d","last_reissued_at":"2026-05-18T02:29:53.472578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:53.472578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.1144","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qO6D19nMC7PobMD0b/0n9v7hBmwCBULQoxv4LUHV4bPvjHMB30FDJkUtrUnmY8rh/n3jyHuOCRApV2ymj/UWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:53:55.805541Z"},"content_sha256":"288ecee32ae2bd1a5f2fa7079b4ec4d4a221fd02cb249e7e0edaaaf76e60d929","schema_version":"1.0","event_id":"sha256:288ecee32ae2bd1a5f2fa7079b4ec4d4a221fd02cb249e7e0edaaaf76e60d929"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:L3BMP2QXELKWWNR62H6VZACSFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some unsolved problems on cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chunhui Lai, Mingjing Liu","submitted_at":"2011-10-06T03:16:43Z","abstract_excerpt":"Hajos' conjecture that every simple even graph on $n$ vertices can be decomposed into at most $(n-1)/2$ cycles (see L. Lovasz, On covering of graphs, in: P. Erdos, G.O.H. Katona (Eds.), Theory of Graphs, Academic Press, New York, 1968, pp. 231 - 236). Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. P. Erdos raised the problem of determining $f(n)$ (see J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, 1976), p.247, Problem 11).\n  Given a graph $H$, what is the maximum number of edges of a graph wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1144","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6C1iCBm3sCgMLLpNFDVwuCqfPFrOj+KttFOYANWABuk/2hvyA4Qd+/RPecKI2zks96QGgHeccS73tWlpM5pxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:53:55.806262Z"},"content_sha256":"beb2d9780da0e152a596f5481aa9e2f7b111d17aef3ec7f3938b5fd1990ae274","schema_version":"1.0","event_id":"sha256:beb2d9780da0e152a596f5481aa9e2f7b111d17aef3ec7f3938b5fd1990ae274"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB/bundle.json","state_url":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3BMP2QXELKWWNR62H6VZACSFB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T03:53:55Z","links":{"resolver":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB","bundle":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB/bundle.json","state":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3BMP2QXELKWWNR62H6VZACSFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:L3BMP2QXELKWWNR62H6VZACSFB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"57d2728ea0b7a531395bc1fc6018f4f7a342f78a7b3ac7d130d38a54dedb1707","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-06T03:16:43Z","title_canon_sha256":"351fecfbb315a87af7b04b6baa1b2ae7ef3cbc29ce2b106e71f437bf06cc30c0"},"schema_version":"1.0","source":{"id":"1110.1144","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1144","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1144v3","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1144","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"L3BMP2QXELKW","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L3BMP2QXELKWWNR6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L3BMP2QX","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:beb2d9780da0e152a596f5481aa9e2f7b111d17aef3ec7f3938b5fd1990ae274","target":"graph","created_at":"2026-05-18T02:29:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Hajos' conjecture that every simple even graph on $n$ vertices can be decomposed into at most $(n-1)/2$ cycles (see L. Lovasz, On covering of graphs, in: P. Erdos, G.O.H. Katona (Eds.), Theory of Graphs, Academic Press, New York, 1968, pp. 231 - 236). Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. P. Erdos raised the problem of determining $f(n)$ (see J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, 1976), p.247, Problem 11).\n  Given a graph $H$, what is the maximum number of edges of a graph wi","authors_text":"Chunhui Lai, Mingjing Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-06T03:16:43Z","title":"Some unsolved problems on cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1144","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:288ecee32ae2bd1a5f2fa7079b4ec4d4a221fd02cb249e7e0edaaaf76e60d929","target":"record","created_at":"2026-05-18T02:29:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"57d2728ea0b7a531395bc1fc6018f4f7a342f78a7b3ac7d130d38a54dedb1707","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-06T03:16:43Z","title_canon_sha256":"351fecfbb315a87af7b04b6baa1b2ae7ef3cbc29ce2b106e71f437bf06cc30c0"},"schema_version":"1.0","source":{"id":"1110.1144","kind":"arxiv","version":3}},"canonical_sha256":"5ec2c7ea1722d56b363ed1fd5c8052285f492a6956646b6c0dde72f262ad7a6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ec2c7ea1722d56b363ed1fd5c8052285f492a6956646b6c0dde72f262ad7a6d","first_computed_at":"2026-05-18T02:29:53.472578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:53.472578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tPkjYR0LLPJuzAYOVZ4to3d56KpciF1wWzb0dwzITyuAhHCrapH2BARaLFkx5l3r+JZ728V8nKFZV8bnLeR0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:53.473105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1144","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:288ecee32ae2bd1a5f2fa7079b4ec4d4a221fd02cb249e7e0edaaaf76e60d929","sha256:beb2d9780da0e152a596f5481aa9e2f7b111d17aef3ec7f3938b5fd1990ae274"],"state_sha256":"08b6da5e5b791a09a245e4ad357b21655e374af49271074f56d7f40a58a5a057"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IJn7yD7tYwYr/EqykqClE9q9zWblQuWEv7OR7w9Zsj9Z3wqXjigmBjT8aDmqyFs/WG7M4kpPWOEPaEECFFBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:53:55.810207Z","bundle_sha256":"ae637a6c1fb60116b9e51a51689340596b36e16f1d3ec8be2fe74d485f77bf38"}}