{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YC6ZANNBGKTELIWPL6JA3O54ZH","short_pith_number":"pith:YC6ZANNB","schema_version":"1.0","canonical_sha256":"c0bd9035a132a645a2cf5f920dbbbcc9eeb5204903c1e4ea6e7ba1f1904866c0","source":{"kind":"arxiv","id":"1609.06522","version":1},"attestation_state":"computed","paper":{"title":"Computing Vertex-Disjoint Paths using MAOs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Jens M. Schmidt, Johanna E. Prei{\\ss}er","submitted_at":"2016-09-21T12:22:49Z","abstract_excerpt":"Let G be a graph with minimum degree $\\delta$. It is well-known that maximal adjacency orderings (MAOs) compute a vertex set S such that every pair of S is connected by at least $\\delta$ internally vertex-disjoint paths in G.\n  We present an algorithm that, given any pair of S, computes these $\\delta$ paths in linear time O(n+m). This improves the previously best solutions for these special vertex pairs, which were flow-based. Our algorithm simplifies a proof about pendant pairs of Mader and makes a purely existential proof of Nagamochi algorithmic."},"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":"1609.06522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-21T12:22:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"59cca29c89a6c0bb0685aba9503e713c9a6cca9f8c61ad9a5f46393ee2f0ef8c","abstract_canon_sha256":"b7b55e792cac8019d96d99b4d5a24d89a2522fb198d7b17bb95b89b9decef1fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:08.043698Z","signature_b64":"PlopiiYAg7o6EtdizMpxL5W2seRXNOhyKva7otBKGRSZz9o0ncwtUtgLbHB91D2gI/M0WG3PW0Wcbk/i94o6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0bd9035a132a645a2cf5f920dbbbcc9eeb5204903c1e4ea6e7ba1f1904866c0","last_reissued_at":"2026-05-18T01:04:08.043108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:08.043108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Vertex-Disjoint Paths using MAOs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Jens M. Schmidt, Johanna E. Prei{\\ss}er","submitted_at":"2016-09-21T12:22:49Z","abstract_excerpt":"Let G be a graph with minimum degree $\\delta$. It is well-known that maximal adjacency orderings (MAOs) compute a vertex set S such that every pair of S is connected by at least $\\delta$ internally vertex-disjoint paths in G.\n  We present an algorithm that, given any pair of S, computes these $\\delta$ paths in linear time O(n+m). This improves the previously best solutions for these special vertex pairs, which were flow-based. Our algorithm simplifies a proof about pendant pairs of Mader and makes a purely existential proof of Nagamochi algorithmic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06522","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":"1609.06522","created_at":"2026-05-18T01:04:08.043210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06522v1","created_at":"2026-05-18T01:04:08.043210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06522","created_at":"2026-05-18T01:04:08.043210+00:00"},{"alias_kind":"pith_short_12","alias_value":"YC6ZANNBGKTE","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YC6ZANNBGKTELIWP","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YC6ZANNB","created_at":"2026-05-18T12:30:53.716459+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/YC6ZANNBGKTELIWPL6JA3O54ZH","json":"https://pith.science/pith/YC6ZANNBGKTELIWPL6JA3O54ZH.json","graph_json":"https://pith.science/api/pith-number/YC6ZANNBGKTELIWPL6JA3O54ZH/graph.json","events_json":"https://pith.science/api/pith-number/YC6ZANNBGKTELIWPL6JA3O54ZH/events.json","paper":"https://pith.science/paper/YC6ZANNB"},"agent_actions":{"view_html":"https://pith.science/pith/YC6ZANNBGKTELIWPL6JA3O54ZH","download_json":"https://pith.science/pith/YC6ZANNBGKTELIWPL6JA3O54ZH.json","view_paper":"https://pith.science/paper/YC6ZANNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06522&json=true","fetch_graph":"https://pith.science/api/pith-number/YC6ZANNBGKTELIWPL6JA3O54ZH/graph.json","fetch_events":"https://pith.science/api/pith-number/YC6ZANNBGKTELIWPL6JA3O54ZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YC6ZANNBGKTELIWPL6JA3O54ZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YC6ZANNBGKTELIWPL6JA3O54ZH/action/storage_attestation","attest_author":"https://pith.science/pith/YC6ZANNBGKTELIWPL6JA3O54ZH/action/author_attestation","sign_citation":"https://pith.science/pith/YC6ZANNBGKTELIWPL6JA3O54ZH/action/citation_signature","submit_replication":"https://pith.science/pith/YC6ZANNBGKTELIWPL6JA3O54ZH/action/replication_record"}},"created_at":"2026-05-18T01:04:08.043210+00:00","updated_at":"2026-05-18T01:04:08.043210+00:00"}