{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OG2GFP5UKXGLOHHE23EBDKZM6U","short_pith_number":"pith:OG2GFP5U","schema_version":"1.0","canonical_sha256":"71b462bfb455ccb71ce4d6c811ab2cf512ee6bb9ad6610044e2d2c7e3bc38c10","source":{"kind":"arxiv","id":"1705.06068","version":1},"attestation_state":"computed","paper":{"title":"On the maximum degree of path-pairable planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, G\\'abor M\\'esz\\'aros, Kamil Popielarz, Richard Snyder","submitted_at":"2017-05-17T09:42:40Z","abstract_excerpt":"A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any $n$-vertex path-pairable planar graph must contain a vertex of degree linear in $n$."},"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":"1705.06068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-17T09:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"13c6f4de426c70870fa75cf086ba918dbb7694f1bb3ab0971affba366d25a41a","abstract_canon_sha256":"c8dea07c9a3b1372e6a126471cfb75a8d8c02c79dd0340da6a292ff8971a6a7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.076118Z","signature_b64":"StkqWywacqHHw9+dMEI8LThrkgzN61Y9cQqOx+jheqdmMIjnD37at6/U2FuuvKB9rkdozqeL7jSurSeJcJe4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71b462bfb455ccb71ce4d6c811ab2cf512ee6bb9ad6610044e2d2c7e3bc38c10","last_reissued_at":"2026-05-18T00:44:19.075649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.075649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum degree of path-pairable planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, G\\'abor M\\'esz\\'aros, Kamil Popielarz, Richard Snyder","submitted_at":"2017-05-17T09:42:40Z","abstract_excerpt":"A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any $n$-vertex path-pairable planar graph must contain a vertex of degree linear in $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06068","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":"1705.06068","created_at":"2026-05-18T00:44:19.075728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06068v1","created_at":"2026-05-18T00:44:19.075728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06068","created_at":"2026-05-18T00:44:19.075728+00:00"},{"alias_kind":"pith_short_12","alias_value":"OG2GFP5UKXGL","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OG2GFP5UKXGLOHHE","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OG2GFP5U","created_at":"2026-05-18T12:31:34.259226+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/OG2GFP5UKXGLOHHE23EBDKZM6U","json":"https://pith.science/pith/OG2GFP5UKXGLOHHE23EBDKZM6U.json","graph_json":"https://pith.science/api/pith-number/OG2GFP5UKXGLOHHE23EBDKZM6U/graph.json","events_json":"https://pith.science/api/pith-number/OG2GFP5UKXGLOHHE23EBDKZM6U/events.json","paper":"https://pith.science/paper/OG2GFP5U"},"agent_actions":{"view_html":"https://pith.science/pith/OG2GFP5UKXGLOHHE23EBDKZM6U","download_json":"https://pith.science/pith/OG2GFP5UKXGLOHHE23EBDKZM6U.json","view_paper":"https://pith.science/paper/OG2GFP5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06068&json=true","fetch_graph":"https://pith.science/api/pith-number/OG2GFP5UKXGLOHHE23EBDKZM6U/graph.json","fetch_events":"https://pith.science/api/pith-number/OG2GFP5UKXGLOHHE23EBDKZM6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OG2GFP5UKXGLOHHE23EBDKZM6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OG2GFP5UKXGLOHHE23EBDKZM6U/action/storage_attestation","attest_author":"https://pith.science/pith/OG2GFP5UKXGLOHHE23EBDKZM6U/action/author_attestation","sign_citation":"https://pith.science/pith/OG2GFP5UKXGLOHHE23EBDKZM6U/action/citation_signature","submit_replication":"https://pith.science/pith/OG2GFP5UKXGLOHHE23EBDKZM6U/action/replication_record"}},"created_at":"2026-05-18T00:44:19.075728+00:00","updated_at":"2026-05-18T00:44:19.075728+00:00"}