{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:L3BMP2QXELKWWNR62H6VZACSFB","short_pith_number":"pith:L3BMP2QX","schema_version":"1.0","canonical_sha256":"5ec2c7ea1722d56b363ed1fd5c8052285f492a6956646b6c0dde72f262ad7a6d","source":{"kind":"arxiv","id":"1110.1144","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.1144","created_at":"2026-05-18T02:29:53.472660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1144v3","created_at":"2026-05-18T02:29:53.472660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1144","created_at":"2026-05-18T02:29:53.472660+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3BMP2QXELKW","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3BMP2QXELKWWNR6","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3BMP2QX","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB","json":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB.json","graph_json":"https://pith.science/api/pith-number/L3BMP2QXELKWWNR62H6VZACSFB/graph.json","events_json":"https://pith.science/api/pith-number/L3BMP2QXELKWWNR62H6VZACSFB/events.json","paper":"https://pith.science/paper/L3BMP2QX"},"agent_actions":{"view_html":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB","download_json":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB.json","view_paper":"https://pith.science/paper/L3BMP2QX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1144&json=true","fetch_graph":"https://pith.science/api/pith-number/L3BMP2QXELKWWNR62H6VZACSFB/graph.json","fetch_events":"https://pith.science/api/pith-number/L3BMP2QXELKWWNR62H6VZACSFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB/action/storage_attestation","attest_author":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB/action/author_attestation","sign_citation":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB/action/citation_signature","submit_replication":"https://pith.science/pith/L3BMP2QXELKWWNR62H6VZACSFB/action/replication_record"}},"created_at":"2026-05-18T02:29:53.472660+00:00","updated_at":"2026-05-18T02:29:53.472660+00:00"}