{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LL65GDMZRYNTQJSQ24IZMQOEE6","short_pith_number":"pith:LL65GDMZ","schema_version":"1.0","canonical_sha256":"5afdd30d998e1b382650d7119641c427b01d8aebe7a9d66c4bb643e90011968e","source":{"kind":"arxiv","id":"1305.6482","version":2},"attestation_state":"computed","paper":{"title":"A new result on the problem of Buratti, Horak and Rosa","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Pasotti, Marco Antonio Pellegrini","submitted_at":"2013-05-28T13:23:31Z","abstract_excerpt":"The conjecture of Peter Horak and Alex Rosa (generalizing that of Marco Buratti) states that a multiset L of v-1 positive integers not exceeding [v/2] is the list of edge-lengths of a suitable Hamiltonian path of the complete graph with vertex-set {0,1,...,v-1} if and only if the following condition (here reformulated in a slightly easier form) is satisfied: for every divisor d of v, the number of multiples of d appearing in L is at most v-d. In this paper we do some preliminary discussions on the conjecture, including its relationship with graph decompositions. Then we prove, as main result, "},"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":"1305.6482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-28T13:23:31Z","cross_cats_sorted":[],"title_canon_sha256":"dd1b67b495f84c599c80191b45c8081e56d8aca28300559c895c6bedc0270f7d","abstract_canon_sha256":"d7433ca38b27063233dc576c9b281fa713e396e0a49f0d830516ce8d62e5988b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:07.135907Z","signature_b64":"myWPKsJqbdJ+tzZmmfcrMZqX+O+nNrrADdZXbpwidU7FRYEb5if+DOhK1v4o8LEQLyA3NO0qHNj+Uvs+EgnpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5afdd30d998e1b382650d7119641c427b01d8aebe7a9d66c4bb643e90011968e","last_reissued_at":"2026-05-18T03:08:07.134847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:07.134847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new result on the problem of Buratti, Horak and Rosa","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Pasotti, Marco Antonio Pellegrini","submitted_at":"2013-05-28T13:23:31Z","abstract_excerpt":"The conjecture of Peter Horak and Alex Rosa (generalizing that of Marco Buratti) states that a multiset L of v-1 positive integers not exceeding [v/2] is the list of edge-lengths of a suitable Hamiltonian path of the complete graph with vertex-set {0,1,...,v-1} if and only if the following condition (here reformulated in a slightly easier form) is satisfied: for every divisor d of v, the number of multiples of d appearing in L is at most v-d. In this paper we do some preliminary discussions on the conjecture, including its relationship with graph decompositions. Then we prove, as main result, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6482","kind":"arxiv","version":2},"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":"1305.6482","created_at":"2026-05-18T03:08:07.134966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6482v2","created_at":"2026-05-18T03:08:07.134966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6482","created_at":"2026-05-18T03:08:07.134966+00:00"},{"alias_kind":"pith_short_12","alias_value":"LL65GDMZRYNT","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LL65GDMZRYNTQJSQ","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LL65GDMZ","created_at":"2026-05-18T12:27:51.066281+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/LL65GDMZRYNTQJSQ24IZMQOEE6","json":"https://pith.science/pith/LL65GDMZRYNTQJSQ24IZMQOEE6.json","graph_json":"https://pith.science/api/pith-number/LL65GDMZRYNTQJSQ24IZMQOEE6/graph.json","events_json":"https://pith.science/api/pith-number/LL65GDMZRYNTQJSQ24IZMQOEE6/events.json","paper":"https://pith.science/paper/LL65GDMZ"},"agent_actions":{"view_html":"https://pith.science/pith/LL65GDMZRYNTQJSQ24IZMQOEE6","download_json":"https://pith.science/pith/LL65GDMZRYNTQJSQ24IZMQOEE6.json","view_paper":"https://pith.science/paper/LL65GDMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6482&json=true","fetch_graph":"https://pith.science/api/pith-number/LL65GDMZRYNTQJSQ24IZMQOEE6/graph.json","fetch_events":"https://pith.science/api/pith-number/LL65GDMZRYNTQJSQ24IZMQOEE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LL65GDMZRYNTQJSQ24IZMQOEE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LL65GDMZRYNTQJSQ24IZMQOEE6/action/storage_attestation","attest_author":"https://pith.science/pith/LL65GDMZRYNTQJSQ24IZMQOEE6/action/author_attestation","sign_citation":"https://pith.science/pith/LL65GDMZRYNTQJSQ24IZMQOEE6/action/citation_signature","submit_replication":"https://pith.science/pith/LL65GDMZRYNTQJSQ24IZMQOEE6/action/replication_record"}},"created_at":"2026-05-18T03:08:07.134966+00:00","updated_at":"2026-05-18T03:08:07.134966+00:00"}