{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:THQU7BZAWADZUGMENQNBWWM3MC","short_pith_number":"pith:THQU7BZA","canonical_record":{"source":{"id":"1401.1793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-08T19:59:25Z","cross_cats_sorted":[],"title_canon_sha256":"09e8e20aa3494aad77525d27efea886f258dea87e76f5d96675d1f588d8a0565","abstract_canon_sha256":"b6f918680c8070b99b9643d7cca0cd84c76e8040c2bdb9946068aec5fdeb3b6e"},"schema_version":"1.0"},"canonical_sha256":"99e14f8720b0079a19846c1a1b599b60b01c95ac61acb45259353ce7a9ca6b68","source":{"kind":"arxiv","id":"1401.1793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1793","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1793v1","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1793","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"THQU7BZAWADZ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"THQU7BZAWADZUGME","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"THQU7BZA","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:THQU7BZAWADZUGMENQNBWWM3MC","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-08T19:59:25Z","cross_cats_sorted":[],"title_canon_sha256":"09e8e20aa3494aad77525d27efea886f258dea87e76f5d96675d1f588d8a0565","abstract_canon_sha256":"b6f918680c8070b99b9643d7cca0cd84c76e8040c2bdb9946068aec5fdeb3b6e"},"schema_version":"1.0"},"canonical_sha256":"99e14f8720b0079a19846c1a1b599b60b01c95ac61acb45259353ce7a9ca6b68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:57.795138Z","signature_b64":"uztQaBW8RApo9G5iOY8U1pH1v+bxFPmZFXYXTdE2dLsVlIRi8yo4yMbl9GQmPDbnOwG3ZePFOAIqkr0epbKgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e14f8720b0079a19846c1a1b599b60b01c95ac61acb45259353ce7a9ca6b68","last_reissued_at":"2026-05-18T03:02:57.794331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:57.794331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1793","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjfrv0obPDnXbFn21GVWv6SN4vIX65sy/Zl+mgtMRBmnhuMx4t+hnA1jbD3Bsot6OlBKSqE7uXzDtEjEvTqlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:44:53.453155Z"},"content_sha256":"df8035fe3c939e85098acde7897cf61fe606fa05bfdf49063799f296b79866ec","schema_version":"1.0","event_id":"sha256:df8035fe3c939e85098acde7897cf61fe606fa05bfdf49063799f296b79866ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:THQU7BZAWADZUGMENQNBWWM3MC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No finite $5$-regular matchstick graph exists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sascha Kurz","submitted_at":"2014-01-08T19:59:25Z","abstract_excerpt":"A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are non-crossing and all vertices have the same degree $r$ we talk of a regular matchstick graph. Due to Euler's polyhedron formula we have $r\\le 5$. The smallest known $4$-regular matchstick graph is the so called Harborth graph consisting of $52$ vertices. In this article we prove that no finite $5$-regular matchstick graph exists."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1793","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wMKJcULRrL83j7pHgaTHou5hMOvx3vYLezsifcaWfplpah8sEjseVdM+h9E5aRwvYRxRNlMGJTlzv7gNXNeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:44:53.453562Z"},"content_sha256":"fe2ffdf4a1d16bc09cc9394fa2ae4f2d9ea04b2422897167066cc6725031bb91","schema_version":"1.0","event_id":"sha256:fe2ffdf4a1d16bc09cc9394fa2ae4f2d9ea04b2422897167066cc6725031bb91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THQU7BZAWADZUGMENQNBWWM3MC/bundle.json","state_url":"https://pith.science/pith/THQU7BZAWADZUGMENQNBWWM3MC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THQU7BZAWADZUGMENQNBWWM3MC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T15:44:53Z","links":{"resolver":"https://pith.science/pith/THQU7BZAWADZUGMENQNBWWM3MC","bundle":"https://pith.science/pith/THQU7BZAWADZUGMENQNBWWM3MC/bundle.json","state":"https://pith.science/pith/THQU7BZAWADZUGMENQNBWWM3MC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THQU7BZAWADZUGMENQNBWWM3MC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:THQU7BZAWADZUGMENQNBWWM3MC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b6f918680c8070b99b9643d7cca0cd84c76e8040c2bdb9946068aec5fdeb3b6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-08T19:59:25Z","title_canon_sha256":"09e8e20aa3494aad77525d27efea886f258dea87e76f5d96675d1f588d8a0565"},"schema_version":"1.0","source":{"id":"1401.1793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1793","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1793v1","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1793","created_at":"2026-05-18T03:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"THQU7BZAWADZ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"THQU7BZAWADZUGME","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"THQU7BZA","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:fe2ffdf4a1d16bc09cc9394fa2ae4f2d9ea04b2422897167066cc6725031bb91","target":"graph","created_at":"2026-05-18T03:02:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are non-crossing and all vertices have the same degree $r$ we talk of a regular matchstick graph. Due to Euler's polyhedron formula we have $r\\le 5$. The smallest known $4$-regular matchstick graph is the so called Harborth graph consisting of $52$ vertices. In this article we prove that no finite $5$-regular matchstick graph exists.","authors_text":"Sascha Kurz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-08T19:59:25Z","title":"No finite $5$-regular matchstick graph exists"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1793","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:df8035fe3c939e85098acde7897cf61fe606fa05bfdf49063799f296b79866ec","target":"record","created_at":"2026-05-18T03:02:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b6f918680c8070b99b9643d7cca0cd84c76e8040c2bdb9946068aec5fdeb3b6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-08T19:59:25Z","title_canon_sha256":"09e8e20aa3494aad77525d27efea886f258dea87e76f5d96675d1f588d8a0565"},"schema_version":"1.0","source":{"id":"1401.1793","kind":"arxiv","version":1}},"canonical_sha256":"99e14f8720b0079a19846c1a1b599b60b01c95ac61acb45259353ce7a9ca6b68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99e14f8720b0079a19846c1a1b599b60b01c95ac61acb45259353ce7a9ca6b68","first_computed_at":"2026-05-18T03:02:57.794331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:57.794331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uztQaBW8RApo9G5iOY8U1pH1v+bxFPmZFXYXTdE2dLsVlIRi8yo4yMbl9GQmPDbnOwG3ZePFOAIqkr0epbKgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:57.795138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df8035fe3c939e85098acde7897cf61fe606fa05bfdf49063799f296b79866ec","sha256:fe2ffdf4a1d16bc09cc9394fa2ae4f2d9ea04b2422897167066cc6725031bb91"],"state_sha256":"b7b850e376fac0869f7843f7e51c91fd4b87b8987428e69d7fad0ba93da23e90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLP8jJOYXD+clSiTqqKaJp7Q2+13WYJgRvSwoYocxWEHjCcOYkloNsUCW5cqUm25qmgEtLvEfSzNG08jnEEpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:44:53.456550Z","bundle_sha256":"4e5da4ef30924ccbf79e692331caa16ef910e4526bb8a0905f8d0598d8dca20f"}}