{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RC4EKHWWY42XM5UKEPQFBWUZP6","short_pith_number":"pith:RC4EKHWW","schema_version":"1.0","canonical_sha256":"88b8451ed6c73576768a23e050da997fb6163451d44d75abc4f6cb7ac47d0dbe","source":{"kind":"arxiv","id":"1310.1376","version":2},"attestation_state":"computed","paper":{"title":"Nonempty Intersection of Longest Paths in Series-Parallel Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Georg Heise, Cristina G. Fernandes, Julia Ehrenm\\\"uller","submitted_at":"2013-10-04T18:56:47Z","abstract_excerpt":"In 1966 Gallai asked whether all longest paths in a connected graph have nonempty intersection. This is not true in general and various counterexamples have been found. However, the answer to Gallai's question is positive for several well-known classes of graphs, as for instance connected outerplanar graphs, connected split graphs, and 2-trees. A graph is series-parallel if it does not contain $K_4$ as a minor. Series-parallel graphs are also known as partial 2-trees, which are arbitrary subgraphs of 2-trees. We present a proof that every connected series-parallel graph has a vertex that is co"},"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":"1310.1376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-04T18:56:47Z","cross_cats_sorted":[],"title_canon_sha256":"04569a51587b7ddcc9d545398673a915061aab4eca2ff4f809773033ef5c3ab4","abstract_canon_sha256":"e0aa6130276097f27c61a558e60fdd3c35629d20ef0c40173b7fed6873069d4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:44.561297Z","signature_b64":"d2FSryCcflEts90LTDalpUr242uIDy4ufYYPZ8VU2v6rFvFPUaXIpNs5RrfhsrcSiSB1pwG12P5YnHq2R0y/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b8451ed6c73576768a23e050da997fb6163451d44d75abc4f6cb7ac47d0dbe","last_reissued_at":"2026-05-18T00:57:44.560743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:44.560743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonempty Intersection of Longest Paths in Series-Parallel Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Georg Heise, Cristina G. Fernandes, Julia Ehrenm\\\"uller","submitted_at":"2013-10-04T18:56:47Z","abstract_excerpt":"In 1966 Gallai asked whether all longest paths in a connected graph have nonempty intersection. This is not true in general and various counterexamples have been found. However, the answer to Gallai's question is positive for several well-known classes of graphs, as for instance connected outerplanar graphs, connected split graphs, and 2-trees. A graph is series-parallel if it does not contain $K_4$ as a minor. Series-parallel graphs are also known as partial 2-trees, which are arbitrary subgraphs of 2-trees. We present a proof that every connected series-parallel graph has a vertex that is co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1376","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":"1310.1376","created_at":"2026-05-18T00:57:44.560833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1376v2","created_at":"2026-05-18T00:57:44.560833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1376","created_at":"2026-05-18T00:57:44.560833+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC4EKHWWY42X","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC4EKHWWY42XM5UK","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC4EKHWW","created_at":"2026-05-18T12:27:57.521954+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/RC4EKHWWY42XM5UKEPQFBWUZP6","json":"https://pith.science/pith/RC4EKHWWY42XM5UKEPQFBWUZP6.json","graph_json":"https://pith.science/api/pith-number/RC4EKHWWY42XM5UKEPQFBWUZP6/graph.json","events_json":"https://pith.science/api/pith-number/RC4EKHWWY42XM5UKEPQFBWUZP6/events.json","paper":"https://pith.science/paper/RC4EKHWW"},"agent_actions":{"view_html":"https://pith.science/pith/RC4EKHWWY42XM5UKEPQFBWUZP6","download_json":"https://pith.science/pith/RC4EKHWWY42XM5UKEPQFBWUZP6.json","view_paper":"https://pith.science/paper/RC4EKHWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1376&json=true","fetch_graph":"https://pith.science/api/pith-number/RC4EKHWWY42XM5UKEPQFBWUZP6/graph.json","fetch_events":"https://pith.science/api/pith-number/RC4EKHWWY42XM5UKEPQFBWUZP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC4EKHWWY42XM5UKEPQFBWUZP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC4EKHWWY42XM5UKEPQFBWUZP6/action/storage_attestation","attest_author":"https://pith.science/pith/RC4EKHWWY42XM5UKEPQFBWUZP6/action/author_attestation","sign_citation":"https://pith.science/pith/RC4EKHWWY42XM5UKEPQFBWUZP6/action/citation_signature","submit_replication":"https://pith.science/pith/RC4EKHWWY42XM5UKEPQFBWUZP6/action/replication_record"}},"created_at":"2026-05-18T00:57:44.560833+00:00","updated_at":"2026-05-18T00:57:44.560833+00:00"}