{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3CTGSFED3A35KGNU5B7BHXMFRW","short_pith_number":"pith:3CTGSFED","canonical_record":{"source":{"id":"1510.02372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-10-08T15:42:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b23e552623110342c3369ae07714e1383c79d6fb8afdc8611a1336a4a53607b2","abstract_canon_sha256":"5a951c4f108ca1e0162d498c7e102815aab36d8a971a5c162f59dd8f44131744"},"schema_version":"1.0"},"canonical_sha256":"d8a6691483d837d519b4e87e13dd858d81b7dd0d31c460d00d01466fdd0f2ae6","source":{"kind":"arxiv","id":"1510.02372","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02372","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02372v2","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02372","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"3CTGSFED3A35","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3CTGSFED3A35KGNU","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3CTGSFED","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3CTGSFED3A35KGNU5B7BHXMFRW","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-10-08T15:42:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b23e552623110342c3369ae07714e1383c79d6fb8afdc8611a1336a4a53607b2","abstract_canon_sha256":"5a951c4f108ca1e0162d498c7e102815aab36d8a971a5c162f59dd8f44131744"},"schema_version":"1.0"},"canonical_sha256":"d8a6691483d837d519b4e87e13dd858d81b7dd0d31c460d00d01466fdd0f2ae6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:01.322715Z","signature_b64":"KhPqQjUEfnMmbAq9OchuRUr/0SzuNQkXr0bH/QAeWChKLaS9ILk0xOs7KrhYDNZYNZvgNeeTCePYVFbc1w9ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8a6691483d837d519b4e87e13dd858d81b7dd0d31c460d00d01466fdd0f2ae6","last_reissued_at":"2026-05-18T00:07:01.322122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:01.322122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02372","source_version":2,"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:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIaXIrItpusR7pWspa3CJnOFEiHRQmxAQ/kUkssEpvNRpkH4SA+xVbOV77GuwI4CnuW5JV6YW2wDvcj7vcWTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T20:46:40.322208Z"},"content_sha256":"ab69cd250dc5eec6575f209cf74034370992a469f00a239f6ff254525614503d","schema_version":"1.0","event_id":"sha256:ab69cd250dc5eec6575f209cf74034370992a469f00a239f6ff254525614503d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3CTGSFED3A35KGNU5B7BHXMFRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-dual binary codes from small covers and simple polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AT","authors_text":"Bo Chen, Li Yu, Zhi L\\\"u","submitted_at":"2015-10-08T15:42:53Z","abstract_excerpt":"We explore the connection between simple polytopes and self-dual binary codes via the theory of small covers. We first show that a small cover $M^n$ over a simple $n$-polytope $P^n$ produces a self-dual code in the sense of Kreck-Puppe if and only if $P^n$ is $n$-colorable and $n$ is odd. Then we show how to describe such a self-dual binary code in terms of the combinatorial information of $P^n$. Moreover, we can define a family of binary codes $\\mathfrak{B}_k(P^n)$, $0\\leq k\\leq n$, from an arbitrary simple $n$-polytope $P^n$. We will give some necessary and sufficient conditions for $\\mathfr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02372","kind":"arxiv","version":2},"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:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XtHVgFBHejJixEaAeGg54ka6OwRc3rjPdlIn5h+c1ZrvF4n09yHFwQDPYrACs3kzpp6qlllVx6zn9sxaAPVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T20:46:40.322577Z"},"content_sha256":"df2ce9d27290c969b4977cfa77f2ae039b0fa78ceb916017f188cc72839b9cc5","schema_version":"1.0","event_id":"sha256:df2ce9d27290c969b4977cfa77f2ae039b0fa78ceb916017f188cc72839b9cc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CTGSFED3A35KGNU5B7BHXMFRW/bundle.json","state_url":"https://pith.science/pith/3CTGSFED3A35KGNU5B7BHXMFRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CTGSFED3A35KGNU5B7BHXMFRW/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-19T20:46:40Z","links":{"resolver":"https://pith.science/pith/3CTGSFED3A35KGNU5B7BHXMFRW","bundle":"https://pith.science/pith/3CTGSFED3A35KGNU5B7BHXMFRW/bundle.json","state":"https://pith.science/pith/3CTGSFED3A35KGNU5B7BHXMFRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CTGSFED3A35KGNU5B7BHXMFRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3CTGSFED3A35KGNU5B7BHXMFRW","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":"5a951c4f108ca1e0162d498c7e102815aab36d8a971a5c162f59dd8f44131744","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-10-08T15:42:53Z","title_canon_sha256":"b23e552623110342c3369ae07714e1383c79d6fb8afdc8611a1336a4a53607b2"},"schema_version":"1.0","source":{"id":"1510.02372","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02372","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02372v2","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02372","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"3CTGSFED3A35","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3CTGSFED3A35KGNU","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3CTGSFED","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:df2ce9d27290c969b4977cfa77f2ae039b0fa78ceb916017f188cc72839b9cc5","target":"graph","created_at":"2026-05-18T00:07:01Z","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 explore the connection between simple polytopes and self-dual binary codes via the theory of small covers. We first show that a small cover $M^n$ over a simple $n$-polytope $P^n$ produces a self-dual code in the sense of Kreck-Puppe if and only if $P^n$ is $n$-colorable and $n$ is odd. Then we show how to describe such a self-dual binary code in terms of the combinatorial information of $P^n$. Moreover, we can define a family of binary codes $\\mathfrak{B}_k(P^n)$, $0\\leq k\\leq n$, from an arbitrary simple $n$-polytope $P^n$. We will give some necessary and sufficient conditions for $\\mathfr","authors_text":"Bo Chen, Li Yu, Zhi L\\\"u","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-10-08T15:42:53Z","title":"Self-dual binary codes from small covers and simple polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02372","kind":"arxiv","version":2},"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:ab69cd250dc5eec6575f209cf74034370992a469f00a239f6ff254525614503d","target":"record","created_at":"2026-05-18T00:07:01Z","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":"5a951c4f108ca1e0162d498c7e102815aab36d8a971a5c162f59dd8f44131744","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-10-08T15:42:53Z","title_canon_sha256":"b23e552623110342c3369ae07714e1383c79d6fb8afdc8611a1336a4a53607b2"},"schema_version":"1.0","source":{"id":"1510.02372","kind":"arxiv","version":2}},"canonical_sha256":"d8a6691483d837d519b4e87e13dd858d81b7dd0d31c460d00d01466fdd0f2ae6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8a6691483d837d519b4e87e13dd858d81b7dd0d31c460d00d01466fdd0f2ae6","first_computed_at":"2026-05-18T00:07:01.322122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:01.322122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KhPqQjUEfnMmbAq9OchuRUr/0SzuNQkXr0bH/QAeWChKLaS9ILk0xOs7KrhYDNZYNZvgNeeTCePYVFbc1w9ADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:01.322715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02372","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab69cd250dc5eec6575f209cf74034370992a469f00a239f6ff254525614503d","sha256:df2ce9d27290c969b4977cfa77f2ae039b0fa78ceb916017f188cc72839b9cc5"],"state_sha256":"a4bab070c668afa60293785c765ba6a2400cd1f2ea88f39cd213a811d47d2011"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1q5nVJT6hTZ3EbyNhoPwFbWr5dCe7GTnRHJyKv7SlmrYWXrei+OUAg8g/7gwWwK7Zd2Pd0EingduiSu98pKdBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T20:46:40.324867Z","bundle_sha256":"adf431799b6de9cd6e4fd1c6092a74cb794514818daa3c04110d8e522342e8e9"}}