{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FZPUHDAYXV4AXKTVG3JB4Q2I6G","short_pith_number":"pith:FZPUHDAY","canonical_record":{"source":{"id":"1803.09139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2018-03-24T17:51:42Z","cross_cats_sorted":[],"title_canon_sha256":"d8af948f2fefe9b73f2be8b9ba7fda35ea7e6db6d1c725375f989273091fbdbf","abstract_canon_sha256":"f98042fb4b706fa1f30733153cd03ad6b4182b6c26f5b745716818a5de384f34"},"schema_version":"1.0"},"canonical_sha256":"2e5f438c18bd780baa7536d21e4348f18bc598ef6bfaa69f9bd919a99c5f246a","source":{"kind":"arxiv","id":"1803.09139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09139","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09139v1","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09139","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"FZPUHDAYXV4A","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FZPUHDAYXV4AXKTV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FZPUHDAY","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FZPUHDAYXV4AXKTVG3JB4Q2I6G","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2018-03-24T17:51:42Z","cross_cats_sorted":[],"title_canon_sha256":"d8af948f2fefe9b73f2be8b9ba7fda35ea7e6db6d1c725375f989273091fbdbf","abstract_canon_sha256":"f98042fb4b706fa1f30733153cd03ad6b4182b6c26f5b745716818a5de384f34"},"schema_version":"1.0"},"canonical_sha256":"2e5f438c18bd780baa7536d21e4348f18bc598ef6bfaa69f9bd919a99c5f246a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:38.549864Z","signature_b64":"pT2ZOMkg3Hk2dHGedlgMOzea7rkdgnCl7+fmZ72jFVqGuEBqyn43IH5K3MI/EaaV4zz1QoVwWd7/ERnf9xrHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e5f438c18bd780baa7536d21e4348f18bc598ef6bfaa69f9bd919a99c5f246a","last_reissued_at":"2026-05-18T00:01:38.549489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:38.549489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09139","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-18T00:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/SSbFYRUfKKnZQVL64cIEhq603Xv2R4spV4Naa4y1K1qeTXLFjNnzTeJCu2mdp7JZg6tulCzDnOQUmo0HWHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:20:08.318842Z"},"content_sha256":"1218ff8d519965bcfa834b59bf55d710f51b190ee7e97206545d5614252ef50f","schema_version":"1.0","event_id":"sha256:1218ff8d519965bcfa834b59bf55d710f51b190ee7e97206545d5614252ef50f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FZPUHDAYXV4AXKTVG3JB4Q2I6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On contact graphs of totally separable packings in low dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"K\\'aroly Bezdek, M\\'arton Nasz\\'odi","submitted_at":"2018-03-24T17:51:42Z","abstract_excerpt":"The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch each other. A packing of translates of a convex body is called totally separable, if any two members can be separated by a hyperplane in $\\mathbb E^d$ disjoint from the interior of every packing element. We give upper bounds on the maximum vertex degree (called separable Hadwiger number) and the maximum number of edges (called maximum separable contact number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09139","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-18T00:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sr9efHYwHbCWgOEEOg03q1xUFlQMssXlTUETP0WCrS9aKJ+1uDM8hzDWSJ7mHXoqsGMcpVGEMxw5iNe9qoUvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:20:08.319215Z"},"content_sha256":"df8e421589d27454928d8e5b5b67b54b06a0dfcd85ccf5eba753660623f37f30","schema_version":"1.0","event_id":"sha256:df8e421589d27454928d8e5b5b67b54b06a0dfcd85ccf5eba753660623f37f30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZPUHDAYXV4AXKTVG3JB4Q2I6G/bundle.json","state_url":"https://pith.science/pith/FZPUHDAYXV4AXKTVG3JB4Q2I6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZPUHDAYXV4AXKTVG3JB4Q2I6G/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-06-12T01:20:08Z","links":{"resolver":"https://pith.science/pith/FZPUHDAYXV4AXKTVG3JB4Q2I6G","bundle":"https://pith.science/pith/FZPUHDAYXV4AXKTVG3JB4Q2I6G/bundle.json","state":"https://pith.science/pith/FZPUHDAYXV4AXKTVG3JB4Q2I6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZPUHDAYXV4AXKTVG3JB4Q2I6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FZPUHDAYXV4AXKTVG3JB4Q2I6G","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":"f98042fb4b706fa1f30733153cd03ad6b4182b6c26f5b745716818a5de384f34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2018-03-24T17:51:42Z","title_canon_sha256":"d8af948f2fefe9b73f2be8b9ba7fda35ea7e6db6d1c725375f989273091fbdbf"},"schema_version":"1.0","source":{"id":"1803.09139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09139","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09139v1","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09139","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"FZPUHDAYXV4A","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FZPUHDAYXV4AXKTV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FZPUHDAY","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:df8e421589d27454928d8e5b5b67b54b06a0dfcd85ccf5eba753660623f37f30","target":"graph","created_at":"2026-05-18T00:01:38Z","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":"The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch each other. A packing of translates of a convex body is called totally separable, if any two members can be separated by a hyperplane in $\\mathbb E^d$ disjoint from the interior of every packing element. We give upper bounds on the maximum vertex degree (called separable Hadwiger number) and the maximum number of edges (called maximum separable contact number","authors_text":"K\\'aroly Bezdek, M\\'arton Nasz\\'odi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2018-03-24T17:51:42Z","title":"On contact graphs of totally separable packings in low dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09139","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:1218ff8d519965bcfa834b59bf55d710f51b190ee7e97206545d5614252ef50f","target":"record","created_at":"2026-05-18T00:01:38Z","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":"f98042fb4b706fa1f30733153cd03ad6b4182b6c26f5b745716818a5de384f34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2018-03-24T17:51:42Z","title_canon_sha256":"d8af948f2fefe9b73f2be8b9ba7fda35ea7e6db6d1c725375f989273091fbdbf"},"schema_version":"1.0","source":{"id":"1803.09139","kind":"arxiv","version":1}},"canonical_sha256":"2e5f438c18bd780baa7536d21e4348f18bc598ef6bfaa69f9bd919a99c5f246a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e5f438c18bd780baa7536d21e4348f18bc598ef6bfaa69f9bd919a99c5f246a","first_computed_at":"2026-05-18T00:01:38.549489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:38.549489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pT2ZOMkg3Hk2dHGedlgMOzea7rkdgnCl7+fmZ72jFVqGuEBqyn43IH5K3MI/EaaV4zz1QoVwWd7/ERnf9xrHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:38.549864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1218ff8d519965bcfa834b59bf55d710f51b190ee7e97206545d5614252ef50f","sha256:df8e421589d27454928d8e5b5b67b54b06a0dfcd85ccf5eba753660623f37f30"],"state_sha256":"bd014909bfd14e6d3388d363d8df19a6a4699f093e0afbcf745cc8bbe5b3f29e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqB1izCAB9SVuZ0KbOodU9I+VT4Y1TrsbZXCCRr8bLMfd9H/HO+/gmi9K9fi9tdZ1LOA4GH7rPAhL793zSmiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:20:08.322214Z","bundle_sha256":"c8a0271e8d33741ca219e44b5b95a8424fccf9be3f700f22e35ce4a2a2a58d4e"}}