{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S5P43NPORJGLWKRH3FFMOOOHOJ","short_pith_number":"pith:S5P43NPO","schema_version":"1.0","canonical_sha256":"975fcdb5ee8a4cbb2a27d94ac739c7726fe6ec822fd4d3f14836bcb0d175b0d2","source":{"kind":"arxiv","id":"1501.00813","version":2},"attestation_state":"computed","paper":{"title":"Path separation by short cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuela Fachini, G\\'erard Cohen, J\\'anos K\\\"orner","submitted_at":"2015-01-05T10:57:42Z","abstract_excerpt":"Two Hamilton paths in $K_n$ are separated by a cycle of length $k$ if their union contains such a cycle. For small fixed values of $k$ we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in $K_n$ such that any pair of paths in the family is separated by a cycle of length $k.$"},"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":"1501.00813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-05T10:57:42Z","cross_cats_sorted":[],"title_canon_sha256":"6da4d2e22935fe2df2f726441d58bc8ad776bcd68f503af362c24b67d670bbde","abstract_canon_sha256":"ea5a95cd9c9bb7c639732f69e4411ef0a9d85ef95cabd35e798694c77b3cac79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:38.836628Z","signature_b64":"buZ/YpTzCE5j5/oVm+7AbVInQw+FDlJB2ERTk6/a/gV//qNPTqIp29Ns+aLp3icQKJnQUTgU7uc+Mrk8UihEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"975fcdb5ee8a4cbb2a27d94ac739c7726fe6ec822fd4d3f14836bcb0d175b0d2","last_reissued_at":"2026-05-18T01:15:38.836012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:38.836012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path separation by short cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuela Fachini, G\\'erard Cohen, J\\'anos K\\\"orner","submitted_at":"2015-01-05T10:57:42Z","abstract_excerpt":"Two Hamilton paths in $K_n$ are separated by a cycle of length $k$ if their union contains such a cycle. For small fixed values of $k$ we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in $K_n$ such that any pair of paths in the family is separated by a cycle of length $k.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00813","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":"1501.00813","created_at":"2026-05-18T01:15:38.836108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00813v2","created_at":"2026-05-18T01:15:38.836108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00813","created_at":"2026-05-18T01:15:38.836108+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5P43NPORJGL","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5P43NPORJGLWKRH","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5P43NPO","created_at":"2026-05-18T12:29:39.896362+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/S5P43NPORJGLWKRH3FFMOOOHOJ","json":"https://pith.science/pith/S5P43NPORJGLWKRH3FFMOOOHOJ.json","graph_json":"https://pith.science/api/pith-number/S5P43NPORJGLWKRH3FFMOOOHOJ/graph.json","events_json":"https://pith.science/api/pith-number/S5P43NPORJGLWKRH3FFMOOOHOJ/events.json","paper":"https://pith.science/paper/S5P43NPO"},"agent_actions":{"view_html":"https://pith.science/pith/S5P43NPORJGLWKRH3FFMOOOHOJ","download_json":"https://pith.science/pith/S5P43NPORJGLWKRH3FFMOOOHOJ.json","view_paper":"https://pith.science/paper/S5P43NPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00813&json=true","fetch_graph":"https://pith.science/api/pith-number/S5P43NPORJGLWKRH3FFMOOOHOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/S5P43NPORJGLWKRH3FFMOOOHOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5P43NPORJGLWKRH3FFMOOOHOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5P43NPORJGLWKRH3FFMOOOHOJ/action/storage_attestation","attest_author":"https://pith.science/pith/S5P43NPORJGLWKRH3FFMOOOHOJ/action/author_attestation","sign_citation":"https://pith.science/pith/S5P43NPORJGLWKRH3FFMOOOHOJ/action/citation_signature","submit_replication":"https://pith.science/pith/S5P43NPORJGLWKRH3FFMOOOHOJ/action/replication_record"}},"created_at":"2026-05-18T01:15:38.836108+00:00","updated_at":"2026-05-18T01:15:38.836108+00:00"}