{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4BBCIIFA5ZM7HY6X3CE6RVC752","short_pith_number":"pith:4BBCIIFA","canonical_record":{"source":{"id":"1112.3307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-14T19:10:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bdbd7046ce58ffff2f590faeef3997d1b6d1777eeaaac78f1e29401eabd19dfd","abstract_canon_sha256":"45fd68ef7dfc3084eb0d70f3e8f2620209fa1f591eeaf04ff6222c49d7371bb1"},"schema_version":"1.0"},"canonical_sha256":"e0422420a0ee59f3e3d7d889e8d45feeb967a4fb3107aa9dc7e9f0326ddd4ea3","source":{"kind":"arxiv","id":"1112.3307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3307","created_at":"2026-05-18T04:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3307v1","created_at":"2026-05-18T04:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3307","created_at":"2026-05-18T04:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"4BBCIIFA5ZM7","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4BBCIIFA5ZM7HY6X","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4BBCIIFA","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4BBCIIFA5ZM7HY6X3CE6RVC752","target":"record","payload":{"canonical_record":{"source":{"id":"1112.3307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-14T19:10:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bdbd7046ce58ffff2f590faeef3997d1b6d1777eeaaac78f1e29401eabd19dfd","abstract_canon_sha256":"45fd68ef7dfc3084eb0d70f3e8f2620209fa1f591eeaf04ff6222c49d7371bb1"},"schema_version":"1.0"},"canonical_sha256":"e0422420a0ee59f3e3d7d889e8d45feeb967a4fb3107aa9dc7e9f0326ddd4ea3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:19.538693Z","signature_b64":"sfWbL8tyAlDQ7wXq9WDWc0Zab565L1hjAv/FiEry39Vo85u63XNXA+unxtJpJBe6Fs22zJlz/1ZrcwAFkP6DDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0422420a0ee59f3e3d7d889e8d45feeb967a4fb3107aa9dc7e9f0326ddd4ea3","last_reissued_at":"2026-05-18T04:06:19.537871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:19.537871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.3307","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-18T04:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FnnB+DbW5fic6F8KqNqc1Qto09lJbDHPcpqjsBYEcs++Cl93Pm8OutcvA1EFd9l62tWdGW8tnrPUu6v3mcf8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:31.701360Z"},"content_sha256":"8782385bd7b10af02ac886549cfc90c6e7ce49c355adbcf41c8b4ef10e279a33","schema_version":"1.0","event_id":"sha256:8782385bd7b10af02ac886549cfc90c6e7ce49c355adbcf41c8b4ef10e279a33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4BBCIIFA5ZM7HY6X3CE6RVC752","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polytope Codes Against Adversaries in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Tse, Lang Tong, Oliver Kosut","submitted_at":"2011-12-14T19:10:39Z","abstract_excerpt":"Network coding is studied when an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than when the adversary controls a given number of edges in the network, in that linear codes are insufficient. To solve the node problem, the class of Polytope Codes is introduced. Polytope Codes are constant composition codes operating over bounded polytopes in integer vector fields. The polytope structure creates additional complexity, but it induces properties on marginal distributions of code vectors so that validities o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3307","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-18T04:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kf49bOV6laWQ8TIFni1GHCl0wwaCzJT4AuCSPWGozpqo1Z6hECAL1JWY+5nUPBEwA8xJ+VUDOm85S+z659BbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:31.701967Z"},"content_sha256":"7e24b2f23df7723b1afc3fee290e8870dae0db57e2691cd11632240544568c09","schema_version":"1.0","event_id":"sha256:7e24b2f23df7723b1afc3fee290e8870dae0db57e2691cd11632240544568c09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BBCIIFA5ZM7HY6X3CE6RVC752/bundle.json","state_url":"https://pith.science/pith/4BBCIIFA5ZM7HY6X3CE6RVC752/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BBCIIFA5ZM7HY6X3CE6RVC752/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-27T16:50:31Z","links":{"resolver":"https://pith.science/pith/4BBCIIFA5ZM7HY6X3CE6RVC752","bundle":"https://pith.science/pith/4BBCIIFA5ZM7HY6X3CE6RVC752/bundle.json","state":"https://pith.science/pith/4BBCIIFA5ZM7HY6X3CE6RVC752/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BBCIIFA5ZM7HY6X3CE6RVC752/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4BBCIIFA5ZM7HY6X3CE6RVC752","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":"45fd68ef7dfc3084eb0d70f3e8f2620209fa1f591eeaf04ff6222c49d7371bb1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-14T19:10:39Z","title_canon_sha256":"bdbd7046ce58ffff2f590faeef3997d1b6d1777eeaaac78f1e29401eabd19dfd"},"schema_version":"1.0","source":{"id":"1112.3307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3307","created_at":"2026-05-18T04:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3307v1","created_at":"2026-05-18T04:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3307","created_at":"2026-05-18T04:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"4BBCIIFA5ZM7","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4BBCIIFA5ZM7HY6X","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4BBCIIFA","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:7e24b2f23df7723b1afc3fee290e8870dae0db57e2691cd11632240544568c09","target":"graph","created_at":"2026-05-18T04:06:19Z","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":"Network coding is studied when an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than when the adversary controls a given number of edges in the network, in that linear codes are insufficient. To solve the node problem, the class of Polytope Codes is introduced. Polytope Codes are constant composition codes operating over bounded polytopes in integer vector fields. The polytope structure creates additional complexity, but it induces properties on marginal distributions of code vectors so that validities o","authors_text":"David Tse, Lang Tong, Oliver Kosut","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-14T19:10:39Z","title":"Polytope Codes Against Adversaries in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3307","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:8782385bd7b10af02ac886549cfc90c6e7ce49c355adbcf41c8b4ef10e279a33","target":"record","created_at":"2026-05-18T04:06:19Z","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":"45fd68ef7dfc3084eb0d70f3e8f2620209fa1f591eeaf04ff6222c49d7371bb1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-14T19:10:39Z","title_canon_sha256":"bdbd7046ce58ffff2f590faeef3997d1b6d1777eeaaac78f1e29401eabd19dfd"},"schema_version":"1.0","source":{"id":"1112.3307","kind":"arxiv","version":1}},"canonical_sha256":"e0422420a0ee59f3e3d7d889e8d45feeb967a4fb3107aa9dc7e9f0326ddd4ea3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0422420a0ee59f3e3d7d889e8d45feeb967a4fb3107aa9dc7e9f0326ddd4ea3","first_computed_at":"2026-05-18T04:06:19.537871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:19.537871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sfWbL8tyAlDQ7wXq9WDWc0Zab565L1hjAv/FiEry39Vo85u63XNXA+unxtJpJBe6Fs22zJlz/1ZrcwAFkP6DDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:19.538693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.3307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8782385bd7b10af02ac886549cfc90c6e7ce49c355adbcf41c8b4ef10e279a33","sha256:7e24b2f23df7723b1afc3fee290e8870dae0db57e2691cd11632240544568c09"],"state_sha256":"ba4c9699750517f02be9768af274ed7e4238cb017265b911b5bb9112d03a3b39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdpvpfBB5Ti7lVLpt8kWFkYz/9hex9L5A9MzWqcqJ601pubbygQNYv4kIjJNI5NIDY4Frj/Se41axLDDxg8kCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:50:31.705327Z","bundle_sha256":"9a37213c78b890d9b7080d140ed4220cd9660fe80ef619da0a8c267224e17f8e"}}