{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:75CW6FAIWLQKJP57UBMCSHVA6A","short_pith_number":"pith:75CW6FAI","schema_version":"1.0","canonical_sha256":"ff456f1408b2e0a4bfbfa058291ea0f03069469dd270e162a440d6823d0d3775","source":{"kind":"arxiv","id":"1408.0408","version":1},"attestation_state":"computed","paper":{"title":"Enomoto and Ota's conjecture holds for large graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Halperin, Colton Magnant, Pouria Salehi Nowbandegani, Vincent Coll","submitted_at":"2014-08-02T19:30:51Z","abstract_excerpt":"In 2000, Enomoto and Ota conjectured that if a graph $G$ satisfies $\\sigma_{2}(G) \\geq n + k - 1$, then for any set of $k$ vertices $v_{1}, \\dots, v_{k}$ and for any positive integers $n_{1}, \\dots, n_{k}$ with $\\sum n_{i} = |G|$, there exists a partition of $V(G)$ into $k$ paths $P_{1}, \\dots, P_{k}$ such that $v_{i}$ is an end of $P_{i}$ and $|P_{i}| = n_{i}$ for all $i$. We prove this conjecture when $|G|$ is large. Our proof uses the Regularity Lemma along with several extremal lemmas, concluding with an absorbing argument to retrieve misbehaving vertices."},"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":"1408.0408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-02T19:30:51Z","cross_cats_sorted":[],"title_canon_sha256":"f4a50fd72f3f8e82ac616de6a12a397d16084b39685f688ecfadb632253b5c9c","abstract_canon_sha256":"cd399993290726b14543512dbd115c9f13b0ec67074a16cc3b3caf9841fb5831"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:57.151270Z","signature_b64":"MSbKiNqoXs6mBPYaAkvuAGgo17hD/yx/2PFD5BUYnMnaf1zItpB8m6uov5MUmq48+Nzp9bAF+zog4SScdKWyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff456f1408b2e0a4bfbfa058291ea0f03069469dd270e162a440d6823d0d3775","last_reissued_at":"2026-05-18T02:45:57.150843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:57.150843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enomoto and Ota's conjecture holds for large graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Halperin, Colton Magnant, Pouria Salehi Nowbandegani, Vincent Coll","submitted_at":"2014-08-02T19:30:51Z","abstract_excerpt":"In 2000, Enomoto and Ota conjectured that if a graph $G$ satisfies $\\sigma_{2}(G) \\geq n + k - 1$, then for any set of $k$ vertices $v_{1}, \\dots, v_{k}$ and for any positive integers $n_{1}, \\dots, n_{k}$ with $\\sum n_{i} = |G|$, there exists a partition of $V(G)$ into $k$ paths $P_{1}, \\dots, P_{k}$ such that $v_{i}$ is an end of $P_{i}$ and $|P_{i}| = n_{i}$ for all $i$. We prove this conjecture when $|G|$ is large. Our proof uses the Regularity Lemma along with several extremal lemmas, concluding with an absorbing argument to retrieve misbehaving vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0408","kind":"arxiv","version":1},"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":"1408.0408","created_at":"2026-05-18T02:45:57.150908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0408v1","created_at":"2026-05-18T02:45:57.150908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0408","created_at":"2026-05-18T02:45:57.150908+00:00"},{"alias_kind":"pith_short_12","alias_value":"75CW6FAIWLQK","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"75CW6FAIWLQKJP57","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"75CW6FAI","created_at":"2026-05-18T12:28:16.859392+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/75CW6FAIWLQKJP57UBMCSHVA6A","json":"https://pith.science/pith/75CW6FAIWLQKJP57UBMCSHVA6A.json","graph_json":"https://pith.science/api/pith-number/75CW6FAIWLQKJP57UBMCSHVA6A/graph.json","events_json":"https://pith.science/api/pith-number/75CW6FAIWLQKJP57UBMCSHVA6A/events.json","paper":"https://pith.science/paper/75CW6FAI"},"agent_actions":{"view_html":"https://pith.science/pith/75CW6FAIWLQKJP57UBMCSHVA6A","download_json":"https://pith.science/pith/75CW6FAIWLQKJP57UBMCSHVA6A.json","view_paper":"https://pith.science/paper/75CW6FAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0408&json=true","fetch_graph":"https://pith.science/api/pith-number/75CW6FAIWLQKJP57UBMCSHVA6A/graph.json","fetch_events":"https://pith.science/api/pith-number/75CW6FAIWLQKJP57UBMCSHVA6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75CW6FAIWLQKJP57UBMCSHVA6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75CW6FAIWLQKJP57UBMCSHVA6A/action/storage_attestation","attest_author":"https://pith.science/pith/75CW6FAIWLQKJP57UBMCSHVA6A/action/author_attestation","sign_citation":"https://pith.science/pith/75CW6FAIWLQKJP57UBMCSHVA6A/action/citation_signature","submit_replication":"https://pith.science/pith/75CW6FAIWLQKJP57UBMCSHVA6A/action/replication_record"}},"created_at":"2026-05-18T02:45:57.150908+00:00","updated_at":"2026-05-18T02:45:57.150908+00:00"}