{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4DNGMDYKXMYDBNP5YAHMK2NZMT","short_pith_number":"pith:4DNGMDYK","schema_version":"1.0","canonical_sha256":"e0da660f0abb3030b5fdc00ec569b964d5d6988efe6c7b948ea45a0bfa392630","source":{"kind":"arxiv","id":"1605.02891","version":1},"attestation_state":"computed","paper":{"title":"Path-Additions of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexander Esch, Daniel Neuwirth, Franz J. Brandenburg","submitted_at":"2016-05-10T08:41:16Z","abstract_excerpt":"Path-addition is an operation that takes a graph and adds an internally vertex-disjoint path between two vertices together with a set of supplementary edges. Path-additions are just the opposite of taking minors.\n  We show that some classes of graphs are closed under path-addition, including non-planar, right angle crossing, fan-crossing free, quasi-planar, (aligned) bar 1-visibility, and interval graphs, whereas others are not closed, including all subclasses of planar graphs, bounded treewidth, k-planar, fan-planar, outer-fan planar, outer-fan-crossing free, and bar (1,j)-visibility 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":"1605.02891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-10T08:41:16Z","cross_cats_sorted":[],"title_canon_sha256":"676eb0010b1f6b58269cc33697d4fff96052140692dd437c175907d06fecee00","abstract_canon_sha256":"9d7171e0264ea06f27a7e8ea267bebe247fb1f8ad8c93990153c7d0660476ca0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:08.282603Z","signature_b64":"oVJATym40z3oV+gpxhIJ1xBBK48M6uUcYGaLUzQq/UgkmkJdJjILX2sYluB2GmL/+DcOUoo8ri6lXrx/3AwABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0da660f0abb3030b5fdc00ec569b964d5d6988efe6c7b948ea45a0bfa392630","last_reissued_at":"2026-05-18T01:15:08.281876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:08.281876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path-Additions of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexander Esch, Daniel Neuwirth, Franz J. Brandenburg","submitted_at":"2016-05-10T08:41:16Z","abstract_excerpt":"Path-addition is an operation that takes a graph and adds an internally vertex-disjoint path between two vertices together with a set of supplementary edges. Path-additions are just the opposite of taking minors.\n  We show that some classes of graphs are closed under path-addition, including non-planar, right angle crossing, fan-crossing free, quasi-planar, (aligned) bar 1-visibility, and interval graphs, whereas others are not closed, including all subclasses of planar graphs, bounded treewidth, k-planar, fan-planar, outer-fan planar, outer-fan-crossing free, and bar (1,j)-visibility graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02891","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":"1605.02891","created_at":"2026-05-18T01:15:08.281986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02891v1","created_at":"2026-05-18T01:15:08.281986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02891","created_at":"2026-05-18T01:15:08.281986+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DNGMDYKXMYD","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DNGMDYKXMYDBNP5","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DNGMDYK","created_at":"2026-05-18T12:29:58.707656+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/4DNGMDYKXMYDBNP5YAHMK2NZMT","json":"https://pith.science/pith/4DNGMDYKXMYDBNP5YAHMK2NZMT.json","graph_json":"https://pith.science/api/pith-number/4DNGMDYKXMYDBNP5YAHMK2NZMT/graph.json","events_json":"https://pith.science/api/pith-number/4DNGMDYKXMYDBNP5YAHMK2NZMT/events.json","paper":"https://pith.science/paper/4DNGMDYK"},"agent_actions":{"view_html":"https://pith.science/pith/4DNGMDYKXMYDBNP5YAHMK2NZMT","download_json":"https://pith.science/pith/4DNGMDYKXMYDBNP5YAHMK2NZMT.json","view_paper":"https://pith.science/paper/4DNGMDYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02891&json=true","fetch_graph":"https://pith.science/api/pith-number/4DNGMDYKXMYDBNP5YAHMK2NZMT/graph.json","fetch_events":"https://pith.science/api/pith-number/4DNGMDYKXMYDBNP5YAHMK2NZMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DNGMDYKXMYDBNP5YAHMK2NZMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DNGMDYKXMYDBNP5YAHMK2NZMT/action/storage_attestation","attest_author":"https://pith.science/pith/4DNGMDYKXMYDBNP5YAHMK2NZMT/action/author_attestation","sign_citation":"https://pith.science/pith/4DNGMDYKXMYDBNP5YAHMK2NZMT/action/citation_signature","submit_replication":"https://pith.science/pith/4DNGMDYKXMYDBNP5YAHMK2NZMT/action/replication_record"}},"created_at":"2026-05-18T01:15:08.281986+00:00","updated_at":"2026-05-18T01:15:08.281986+00:00"}