{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C2UIQI2AH4RZ6XFPQQJHTWB4DC","short_pith_number":"pith:C2UIQI2A","schema_version":"1.0","canonical_sha256":"16a88823403f239f5caf841279d83c18a020adca2d49603c538930a0b0160979","source":{"kind":"arxiv","id":"1604.07134","version":5},"attestation_state":"computed","paper":{"title":"New minimal (4; n)-regular matchstick graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Mike Winkler, Peter Dinkelacker, Stefan Vogel","submitted_at":"2016-04-25T05:23:56Z","abstract_excerpt":"A matchstick graph is a graph drawn with straight edges in the plane such that the edges have unit length, and non-adjacent edges do not intersect. We call a matchstick graph ($m;n)$-regular if every vertex has only degree $m$ or $n$. In this article the authors present the latest known $(4;n)$-regular matchstick graphs for $4\\leq n\\leq11$ with a minimum number of vertices."},"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":"1604.07134","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-04-25T05:23:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"79491ce08a947d0843e07fad1eef2f0304488f26920b874421844053b720b49b","abstract_canon_sha256":"9871051354d77da66c3fd9a6d661c6066fd0174a74fd32b8e059f92fde30b23a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:13.694042Z","signature_b64":"zFGjUoLAbqE4TyJtrNzX6qsrQYJrs5v+OxbC2eVD2L6GHy13yNWfv9vhk49QvmZ2cAuYjqS0Oioz3chDcfenCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16a88823403f239f5caf841279d83c18a020adca2d49603c538930a0b0160979","last_reissued_at":"2026-05-18T00:17:13.693330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:13.693330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New minimal (4; n)-regular matchstick graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Mike Winkler, Peter Dinkelacker, Stefan Vogel","submitted_at":"2016-04-25T05:23:56Z","abstract_excerpt":"A matchstick graph is a graph drawn with straight edges in the plane such that the edges have unit length, and non-adjacent edges do not intersect. We call a matchstick graph ($m;n)$-regular if every vertex has only degree $m$ or $n$. In this article the authors present the latest known $(4;n)$-regular matchstick graphs for $4\\leq n\\leq11$ with a minimum number of vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07134","kind":"arxiv","version":5},"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":"1604.07134","created_at":"2026-05-18T00:17:13.693430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07134v5","created_at":"2026-05-18T00:17:13.693430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07134","created_at":"2026-05-18T00:17:13.693430+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2UIQI2AH4RZ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2UIQI2AH4RZ6XFP","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2UIQI2A","created_at":"2026-05-18T12:30:09.641336+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/C2UIQI2AH4RZ6XFPQQJHTWB4DC","json":"https://pith.science/pith/C2UIQI2AH4RZ6XFPQQJHTWB4DC.json","graph_json":"https://pith.science/api/pith-number/C2UIQI2AH4RZ6XFPQQJHTWB4DC/graph.json","events_json":"https://pith.science/api/pith-number/C2UIQI2AH4RZ6XFPQQJHTWB4DC/events.json","paper":"https://pith.science/paper/C2UIQI2A"},"agent_actions":{"view_html":"https://pith.science/pith/C2UIQI2AH4RZ6XFPQQJHTWB4DC","download_json":"https://pith.science/pith/C2UIQI2AH4RZ6XFPQQJHTWB4DC.json","view_paper":"https://pith.science/paper/C2UIQI2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07134&json=true","fetch_graph":"https://pith.science/api/pith-number/C2UIQI2AH4RZ6XFPQQJHTWB4DC/graph.json","fetch_events":"https://pith.science/api/pith-number/C2UIQI2AH4RZ6XFPQQJHTWB4DC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2UIQI2AH4RZ6XFPQQJHTWB4DC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2UIQI2AH4RZ6XFPQQJHTWB4DC/action/storage_attestation","attest_author":"https://pith.science/pith/C2UIQI2AH4RZ6XFPQQJHTWB4DC/action/author_attestation","sign_citation":"https://pith.science/pith/C2UIQI2AH4RZ6XFPQQJHTWB4DC/action/citation_signature","submit_replication":"https://pith.science/pith/C2UIQI2AH4RZ6XFPQQJHTWB4DC/action/replication_record"}},"created_at":"2026-05-18T00:17:13.693430+00:00","updated_at":"2026-05-18T00:17:13.693430+00:00"}