{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TM67Z63LCYLAHVJNWW7WTJVJ3C","short_pith_number":"pith:TM67Z63L","canonical_record":{"source":{"id":"1401.4372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-17T14:49:16Z","cross_cats_sorted":[],"title_canon_sha256":"01ba6cac168e48007d99fbd7c74078b4253844b65f29dd0087290a750fe9964d","abstract_canon_sha256":"b04a3a1107611e130652220a67079cab60acb49448e47e91245714bfd6b9623a"},"schema_version":"1.0"},"canonical_sha256":"9b3dfcfb6b161603d52db5bf69a6a9d8afd65a34b1c91c86f029327d74836f78","source":{"kind":"arxiv","id":"1401.4372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4372","created_at":"2026-05-17T23:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4372v1","created_at":"2026-05-17T23:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4372","created_at":"2026-05-17T23:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"TM67Z63LCYLA","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TM67Z63LCYLAHVJN","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TM67Z63L","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TM67Z63LCYLAHVJNWW7WTJVJ3C","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-17T14:49:16Z","cross_cats_sorted":[],"title_canon_sha256":"01ba6cac168e48007d99fbd7c74078b4253844b65f29dd0087290a750fe9964d","abstract_canon_sha256":"b04a3a1107611e130652220a67079cab60acb49448e47e91245714bfd6b9623a"},"schema_version":"1.0"},"canonical_sha256":"9b3dfcfb6b161603d52db5bf69a6a9d8afd65a34b1c91c86f029327d74836f78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:44.649759Z","signature_b64":"+tjyOLsvBbVAUW8D5MwHR2D2CHdIJ8kWhMqPU4XT0tRj2EA7sonFvC2tmGvTi9oqen5qnE1ISqXwAWL8GXnFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b3dfcfb6b161603d52db5bf69a6a9d8afd65a34b1c91c86f029327d74836f78","last_reissued_at":"2026-05-17T23:49:44.649252Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:44.649252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4372","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-17T23:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQNeY81UQ5uZYTkOHMqRg8qBiHH1m7J2Z15XXI9v8Evx6jBtmzjtmFFyNrUU+51tEeRI3yaun4MigPE8+aguCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:20:39.393660Z"},"content_sha256":"a002f7773f7895fc16824b2635b49bc483028e7c55c9b6ed4aa4c91e24172e46","schema_version":"1.0","event_id":"sha256:a002f7773f7895fc16824b2635b49bc483028e7c55c9b6ed4aa4c91e24172e46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TM67Z63LCYLAHVJNWW7WTJVJ3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regular matchstick graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rom Pinchasi, Sascha Kurz","submitted_at":"2014-01-17T14:49:16Z","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 and provide a lower bound for the number of verti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4372","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-17T23:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3kmbq/Azf4jCxLVVNBQCE3IoTvlBfSNz4cRfHraw1jMy6ry/pTADkN4KidxBTmIsy7HMEZtPr/o9ohk39MqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:20:39.394678Z"},"content_sha256":"8e5ea96793141a5da601039234a187ea2f8345b2b3d173882e09f335ae23ebe7","schema_version":"1.0","event_id":"sha256:8e5ea96793141a5da601039234a187ea2f8345b2b3d173882e09f335ae23ebe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TM67Z63LCYLAHVJNWW7WTJVJ3C/bundle.json","state_url":"https://pith.science/pith/TM67Z63LCYLAHVJNWW7WTJVJ3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TM67Z63LCYLAHVJNWW7WTJVJ3C/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-25T13:20:39Z","links":{"resolver":"https://pith.science/pith/TM67Z63LCYLAHVJNWW7WTJVJ3C","bundle":"https://pith.science/pith/TM67Z63LCYLAHVJNWW7WTJVJ3C/bundle.json","state":"https://pith.science/pith/TM67Z63LCYLAHVJNWW7WTJVJ3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TM67Z63LCYLAHVJNWW7WTJVJ3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TM67Z63LCYLAHVJNWW7WTJVJ3C","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":"b04a3a1107611e130652220a67079cab60acb49448e47e91245714bfd6b9623a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-17T14:49:16Z","title_canon_sha256":"01ba6cac168e48007d99fbd7c74078b4253844b65f29dd0087290a750fe9964d"},"schema_version":"1.0","source":{"id":"1401.4372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4372","created_at":"2026-05-17T23:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4372v1","created_at":"2026-05-17T23:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4372","created_at":"2026-05-17T23:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"TM67Z63LCYLA","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TM67Z63LCYLAHVJN","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TM67Z63L","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:8e5ea96793141a5da601039234a187ea2f8345b2b3d173882e09f335ae23ebe7","target":"graph","created_at":"2026-05-17T23:49:44Z","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 and provide a lower bound for the number of verti","authors_text":"Rom Pinchasi, Sascha Kurz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-17T14:49:16Z","title":"Regular matchstick graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4372","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:a002f7773f7895fc16824b2635b49bc483028e7c55c9b6ed4aa4c91e24172e46","target":"record","created_at":"2026-05-17T23:49:44Z","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":"b04a3a1107611e130652220a67079cab60acb49448e47e91245714bfd6b9623a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-17T14:49:16Z","title_canon_sha256":"01ba6cac168e48007d99fbd7c74078b4253844b65f29dd0087290a750fe9964d"},"schema_version":"1.0","source":{"id":"1401.4372","kind":"arxiv","version":1}},"canonical_sha256":"9b3dfcfb6b161603d52db5bf69a6a9d8afd65a34b1c91c86f029327d74836f78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b3dfcfb6b161603d52db5bf69a6a9d8afd65a34b1c91c86f029327d74836f78","first_computed_at":"2026-05-17T23:49:44.649252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:44.649252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+tjyOLsvBbVAUW8D5MwHR2D2CHdIJ8kWhMqPU4XT0tRj2EA7sonFvC2tmGvTi9oqen5qnE1ISqXwAWL8GXnFAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:44.649759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a002f7773f7895fc16824b2635b49bc483028e7c55c9b6ed4aa4c91e24172e46","sha256:8e5ea96793141a5da601039234a187ea2f8345b2b3d173882e09f335ae23ebe7"],"state_sha256":"c46f98ee93b2cf447bd07568006ed93a3c4341fe5c47e5865f2a22e5f8d60da7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6C+YeGu8e0DN0bUHm1nbBWYZss0/IfxWgmjvGul3ePq+k0oNjB5PQqcDtPnUR6Yf6KHjjuGyqi2Fp99WaFTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:20:39.397738Z","bundle_sha256":"3dd509ba5629145bf548cf268c8ac4d83a1340cf47325182a9ffc78f5fedf17a"}}