{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H5AD7F6VSNRDZLRIVNII7BAEHA","short_pith_number":"pith:H5AD7F6V","schema_version":"1.0","canonical_sha256":"3f403f97d593623cae28ab508f840438076f70bf59e8128b53cc663cb7ae1122","source":{"kind":"arxiv","id":"1503.08258","version":1},"attestation_state":"computed","paper":{"title":"Excluding long paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Jia","submitted_at":"2015-03-28T02:22:32Z","abstract_excerpt":"Ding (1992) proved that for each integer ${m} \\geqslant 0$, and every infinite sequence of finite simple graphs $G_1, G_2, \\ldots$, if none of these graphs contains a path of length ${m}$ as a subgraph, then there are indices $i < j$ such that $G_i$ is isomorphic to an induced subgraph of $G_j$. We generalise this result to infinite graphs, possibly with parallel edges and loops."},"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":"1503.08258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-28T02:22:32Z","cross_cats_sorted":[],"title_canon_sha256":"7ad4560ed96c888a273a95e46f195534636524c22cd12d33dfc1d3f952a95eac","abstract_canon_sha256":"c80569e87aa8f0265b22d2265726d5a4e35c92475d9d3a6b32e3b2821f794c22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:02.364427Z","signature_b64":"ZezM4oT/yJ3SmCdmU5t6m8Ntw0effJZGOY7hFOdlxpfU9Q0U9koyKV7ZAS97ujYCB2sKz6zBfK40+olxWMNXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f403f97d593623cae28ab508f840438076f70bf59e8128b53cc663cb7ae1122","last_reissued_at":"2026-05-18T02:20:02.363743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:02.363743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Excluding long paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Jia","submitted_at":"2015-03-28T02:22:32Z","abstract_excerpt":"Ding (1992) proved that for each integer ${m} \\geqslant 0$, and every infinite sequence of finite simple graphs $G_1, G_2, \\ldots$, if none of these graphs contains a path of length ${m}$ as a subgraph, then there are indices $i < j$ such that $G_i$ is isomorphic to an induced subgraph of $G_j$. We generalise this result to infinite graphs, possibly with parallel edges and loops."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08258","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":"1503.08258","created_at":"2026-05-18T02:20:02.363847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08258v1","created_at":"2026-05-18T02:20:02.363847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08258","created_at":"2026-05-18T02:20:02.363847+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5AD7F6VSNRD","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5AD7F6VSNRDZLRI","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5AD7F6V","created_at":"2026-05-18T12:29:22.688609+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/H5AD7F6VSNRDZLRIVNII7BAEHA","json":"https://pith.science/pith/H5AD7F6VSNRDZLRIVNII7BAEHA.json","graph_json":"https://pith.science/api/pith-number/H5AD7F6VSNRDZLRIVNII7BAEHA/graph.json","events_json":"https://pith.science/api/pith-number/H5AD7F6VSNRDZLRIVNII7BAEHA/events.json","paper":"https://pith.science/paper/H5AD7F6V"},"agent_actions":{"view_html":"https://pith.science/pith/H5AD7F6VSNRDZLRIVNII7BAEHA","download_json":"https://pith.science/pith/H5AD7F6VSNRDZLRIVNII7BAEHA.json","view_paper":"https://pith.science/paper/H5AD7F6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08258&json=true","fetch_graph":"https://pith.science/api/pith-number/H5AD7F6VSNRDZLRIVNII7BAEHA/graph.json","fetch_events":"https://pith.science/api/pith-number/H5AD7F6VSNRDZLRIVNII7BAEHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5AD7F6VSNRDZLRIVNII7BAEHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5AD7F6VSNRDZLRIVNII7BAEHA/action/storage_attestation","attest_author":"https://pith.science/pith/H5AD7F6VSNRDZLRIVNII7BAEHA/action/author_attestation","sign_citation":"https://pith.science/pith/H5AD7F6VSNRDZLRIVNII7BAEHA/action/citation_signature","submit_replication":"https://pith.science/pith/H5AD7F6VSNRDZLRIVNII7BAEHA/action/replication_record"}},"created_at":"2026-05-18T02:20:02.363847+00:00","updated_at":"2026-05-18T02:20:02.363847+00:00"}