{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O5RPP4LPIBYRQAXMDC3ZBJVIGW","short_pith_number":"pith:O5RPP4LP","canonical_record":{"source":{"id":"1601.02577","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-11T20:13:53Z","cross_cats_sorted":[],"title_canon_sha256":"a3e1a1295b06e01d9ae18fec89cfef351444f6203698d6477ebf5f8ce239a4cf","abstract_canon_sha256":"f29fbba7421df89f2852b4cf4c9fd148e63dfb4d8ae5ebe034a11022f9c2d2eb"},"schema_version":"1.0"},"canonical_sha256":"7762f7f16f40711802ec18b790a6a835b5332ae84ee691303d0eef204fa21e9a","source":{"kind":"arxiv","id":"1601.02577","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02577","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02577v3","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02577","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"O5RPP4LPIBYR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O5RPP4LPIBYRQAXM","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O5RPP4LP","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O5RPP4LPIBYRQAXMDC3ZBJVIGW","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02577","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-11T20:13:53Z","cross_cats_sorted":[],"title_canon_sha256":"a3e1a1295b06e01d9ae18fec89cfef351444f6203698d6477ebf5f8ce239a4cf","abstract_canon_sha256":"f29fbba7421df89f2852b4cf4c9fd148e63dfb4d8ae5ebe034a11022f9c2d2eb"},"schema_version":"1.0"},"canonical_sha256":"7762f7f16f40711802ec18b790a6a835b5332ae84ee691303d0eef204fa21e9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:41.141802Z","signature_b64":"nKBYGt30mlZNF5oBTji7Mm+ZkwuIFWRQYP1OrAbtRIwwZaZYoJr5bzk/jV2aIr+Ozd3ltt6wcSf/ZdWz+6/oBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7762f7f16f40711802ec18b790a6a835b5332ae84ee691303d0eef204fa21e9a","last_reissued_at":"2026-05-18T00:05:41.141275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:41.141275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02577","source_version":3,"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:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6dlMQ3j1hjOx2p1aMwnRr6Rh/JQ989xGVGvM5/rcvcxgSofY5ykUz1aF32z7pP2enpbJ4YblUBtELjEePVoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:52:23.241898Z"},"content_sha256":"1130a09e521535d5b150a30ea1cd3cf5e19ebd8af90cb906b3ad8d0aa05e0bba","schema_version":"1.0","event_id":"sha256:1130a09e521535d5b150a30ea1cd3cf5e19ebd8af90cb906b3ad8d0aa05e0bba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O5RPP4LPIBYRQAXMDC3ZBJVIGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumeration of lattice 3-polytopes by their number of lattice points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Francisco Santos, M\\'onica Blanco","submitted_at":"2016-01-11T20:13:53Z","abstract_excerpt":"We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most eleven lattice points (there are 216,453 of them).\n  In order to achieve this we prove that if $P$ is a lattice 3-polytope of width larger than one and with at least seven lattice points then it fits in one of three categories that we call boxed, spiked and merged.\n  Boxed polytopes have at most 11 lattice points; in particular they are finitely many, and we e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02577","kind":"arxiv","version":3},"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:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2NOnFpnDr7Z4TON9hdLbkXFGF78eNnglyAwJFY0L3shvyhsK79Nr3HfWh1NaaEJk0e00qhtN93P6ioX9MGHGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:52:23.242505Z"},"content_sha256":"742deae4ae9857070e89cff705c610a0163d8661f18d861795ecc738f574265c","schema_version":"1.0","event_id":"sha256:742deae4ae9857070e89cff705c610a0163d8661f18d861795ecc738f574265c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5RPP4LPIBYRQAXMDC3ZBJVIGW/bundle.json","state_url":"https://pith.science/pith/O5RPP4LPIBYRQAXMDC3ZBJVIGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5RPP4LPIBYRQAXMDC3ZBJVIGW/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-30T20:52:23Z","links":{"resolver":"https://pith.science/pith/O5RPP4LPIBYRQAXMDC3ZBJVIGW","bundle":"https://pith.science/pith/O5RPP4LPIBYRQAXMDC3ZBJVIGW/bundle.json","state":"https://pith.science/pith/O5RPP4LPIBYRQAXMDC3ZBJVIGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5RPP4LPIBYRQAXMDC3ZBJVIGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O5RPP4LPIBYRQAXMDC3ZBJVIGW","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":"f29fbba7421df89f2852b4cf4c9fd148e63dfb4d8ae5ebe034a11022f9c2d2eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-11T20:13:53Z","title_canon_sha256":"a3e1a1295b06e01d9ae18fec89cfef351444f6203698d6477ebf5f8ce239a4cf"},"schema_version":"1.0","source":{"id":"1601.02577","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02577","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02577v3","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02577","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"O5RPP4LPIBYR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O5RPP4LPIBYRQAXM","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O5RPP4LP","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:742deae4ae9857070e89cff705c610a0163d8661f18d861795ecc738f574265c","target":"graph","created_at":"2026-05-18T00:05:41Z","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":"We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most eleven lattice points (there are 216,453 of them).\n  In order to achieve this we prove that if $P$ is a lattice 3-polytope of width larger than one and with at least seven lattice points then it fits in one of three categories that we call boxed, spiked and merged.\n  Boxed polytopes have at most 11 lattice points; in particular they are finitely many, and we e","authors_text":"Francisco Santos, M\\'onica Blanco","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-11T20:13:53Z","title":"Enumeration of lattice 3-polytopes by their number of lattice points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02577","kind":"arxiv","version":3},"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:1130a09e521535d5b150a30ea1cd3cf5e19ebd8af90cb906b3ad8d0aa05e0bba","target":"record","created_at":"2026-05-18T00:05:41Z","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":"f29fbba7421df89f2852b4cf4c9fd148e63dfb4d8ae5ebe034a11022f9c2d2eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-11T20:13:53Z","title_canon_sha256":"a3e1a1295b06e01d9ae18fec89cfef351444f6203698d6477ebf5f8ce239a4cf"},"schema_version":"1.0","source":{"id":"1601.02577","kind":"arxiv","version":3}},"canonical_sha256":"7762f7f16f40711802ec18b790a6a835b5332ae84ee691303d0eef204fa21e9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7762f7f16f40711802ec18b790a6a835b5332ae84ee691303d0eef204fa21e9a","first_computed_at":"2026-05-18T00:05:41.141275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:41.141275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nKBYGt30mlZNF5oBTji7Mm+ZkwuIFWRQYP1OrAbtRIwwZaZYoJr5bzk/jV2aIr+Ozd3ltt6wcSf/ZdWz+6/oBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:41.141802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02577","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1130a09e521535d5b150a30ea1cd3cf5e19ebd8af90cb906b3ad8d0aa05e0bba","sha256:742deae4ae9857070e89cff705c610a0163d8661f18d861795ecc738f574265c"],"state_sha256":"5891bda01a635395af8d41636a52351bad2a9cff81dc4a64ea60dd8c2b07a191"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8LhWHBNLTPP2NLIME+z3cy/NS4NStzwpwJxSeYaEjSHeSbaE60tvpCENYMTGwtrSlCXNg1Eet9MnZKuAJxABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:52:23.246099Z","bundle_sha256":"36156ae5951e35d7a1f8bfad4b92a7b9886ac35a2aa6bee5e8b8d9321ccb3a44"}}