{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZDWZNWUXBYDOZ3AJFFIY56A2R6","short_pith_number":"pith:ZDWZNWUX","schema_version":"1.0","canonical_sha256":"c8ed96da970e06ecec0929518ef81a8f92757886a554202968a4d18fb5af81bd","source":{"kind":"arxiv","id":"1511.03100","version":1},"attestation_state":"computed","paper":{"title":"A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jean-Fran\\c{c}ois Mascari, Massimiliano Caramia, Nicola Apollonio, Paolo Giulio Franciosa","submitted_at":"2015-11-10T13:21:19Z","abstract_excerpt":"Bandelt and Mulder's structural characterization of Bipartite Distance Hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by repeatedly adding either pending vertices or twins (i.e., vertices with the same neighborhood as an existing one). Dirac and Duffin's structural characterization of 2-connected series-parallel graphs asserts that such graphs can be built inductively starting from a single edge by adding either edges in series or in parallel. In this paper we prove that the two constructions are the same construction when bipartite graphs"},"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":"1511.03100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-10T13:21:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"896885407ebcdac8048f233d518a8da9d42af10a028fcf137ee0d30e4b306c6e","abstract_canon_sha256":"cc5f2fd4b95cd653032dee7ab8402ed6dc5453798b9ab5697bafeeb2bbaa9259"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:17.006812Z","signature_b64":"6zDKusUsi52Ptdl+5qy6sz0SQDeo+s+b00gvtKjyw0/IFv78EFplB8ThgOPJ5FdC6fNYUi15ee9HxGmTRENABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8ed96da970e06ecec0929518ef81a8f92757886a554202968a4d18fb5af81bd","last_reissued_at":"2026-05-18T01:27:17.006291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:17.006291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jean-Fran\\c{c}ois Mascari, Massimiliano Caramia, Nicola Apollonio, Paolo Giulio Franciosa","submitted_at":"2015-11-10T13:21:19Z","abstract_excerpt":"Bandelt and Mulder's structural characterization of Bipartite Distance Hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by repeatedly adding either pending vertices or twins (i.e., vertices with the same neighborhood as an existing one). Dirac and Duffin's structural characterization of 2-connected series-parallel graphs asserts that such graphs can be built inductively starting from a single edge by adding either edges in series or in parallel. In this paper we prove that the two constructions are the same construction when bipartite graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03100","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":"1511.03100","created_at":"2026-05-18T01:27:17.006387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03100v1","created_at":"2026-05-18T01:27:17.006387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03100","created_at":"2026-05-18T01:27:17.006387+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDWZNWUXBYDO","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDWZNWUXBYDOZ3AJ","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDWZNWUX","created_at":"2026-05-18T12:29:52.810259+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/ZDWZNWUXBYDOZ3AJFFIY56A2R6","json":"https://pith.science/pith/ZDWZNWUXBYDOZ3AJFFIY56A2R6.json","graph_json":"https://pith.science/api/pith-number/ZDWZNWUXBYDOZ3AJFFIY56A2R6/graph.json","events_json":"https://pith.science/api/pith-number/ZDWZNWUXBYDOZ3AJFFIY56A2R6/events.json","paper":"https://pith.science/paper/ZDWZNWUX"},"agent_actions":{"view_html":"https://pith.science/pith/ZDWZNWUXBYDOZ3AJFFIY56A2R6","download_json":"https://pith.science/pith/ZDWZNWUXBYDOZ3AJFFIY56A2R6.json","view_paper":"https://pith.science/paper/ZDWZNWUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03100&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDWZNWUXBYDOZ3AJFFIY56A2R6/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDWZNWUXBYDOZ3AJFFIY56A2R6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDWZNWUXBYDOZ3AJFFIY56A2R6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDWZNWUXBYDOZ3AJFFIY56A2R6/action/storage_attestation","attest_author":"https://pith.science/pith/ZDWZNWUXBYDOZ3AJFFIY56A2R6/action/author_attestation","sign_citation":"https://pith.science/pith/ZDWZNWUXBYDOZ3AJFFIY56A2R6/action/citation_signature","submit_replication":"https://pith.science/pith/ZDWZNWUXBYDOZ3AJFFIY56A2R6/action/replication_record"}},"created_at":"2026-05-18T01:27:17.006387+00:00","updated_at":"2026-05-18T01:27:17.006387+00:00"}