{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OJZSDADCZFFFOVIBABDK4RNCCT","short_pith_number":"pith:OJZSDADC","canonical_record":{"source":{"id":"1208.2076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T02:05:44Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"94cbe3a8f03b88030296b8cc851a68cb667f022941bf718dbfe4ea491027ebd1","abstract_canon_sha256":"02cdec5039b5f1a412764dbd89f1a89e68dba2f18c5a445867d62e77b2eb5d9c"},"schema_version":"1.0"},"canonical_sha256":"7273218062c94a5755010046ae45a214cbb762cdb6b18a017395e9a27b823517","source":{"kind":"arxiv","id":"1208.2076","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2076","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2076v2","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2076","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"OJZSDADCZFFF","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OJZSDADCZFFFOVIB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OJZSDADC","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OJZSDADCZFFFOVIBABDK4RNCCT","target":"record","payload":{"canonical_record":{"source":{"id":"1208.2076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T02:05:44Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"94cbe3a8f03b88030296b8cc851a68cb667f022941bf718dbfe4ea491027ebd1","abstract_canon_sha256":"02cdec5039b5f1a412764dbd89f1a89e68dba2f18c5a445867d62e77b2eb5d9c"},"schema_version":"1.0"},"canonical_sha256":"7273218062c94a5755010046ae45a214cbb762cdb6b18a017395e9a27b823517","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:32.871031Z","signature_b64":"3mFleUZ+AKokU8xJYISBcBOCtxoQ3ICZkE8lrw9rNYlYFbW54VoQob7ZoytxEAYQhu/t6R7uP1SJIW+S5efQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7273218062c94a5755010046ae45a214cbb762cdb6b18a017395e9a27b823517","last_reissued_at":"2026-05-18T03:06:32.870567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:32.870567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.2076","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-18T03:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1MragABs0XoRf/R8X7oczG8v6QPVrkYf25a6uiTXNKoDAutBPc0/SEG9nS+WQ5YeKDmn3R5VB2YnS7DWxZHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:39:09.474119Z"},"content_sha256":"fe7f8051fd7d9207c6318cc0198931954e42d631815f21ffc144df31c65f224e","schema_version":"1.0","event_id":"sha256:fe7f8051fd7d9207c6318cc0198931954e42d631815f21ffc144df31c65f224e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OJZSDADCZFFFOVIBABDK4RNCCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper Bounds on the Number of Codewords of Some Separating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Myong-Son Sin, Ok-Hyon Song, Ryul Kim","submitted_at":"2012-08-10T02:05:44Z","abstract_excerpt":"Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study upper bounds for separating codes. First, some new upper bound for restricted separating codes is proposed. Then we illustrate that the Upper Bound Conjecture for separating Reed-Solomon codes inherited from Silverberg's question holds true for almost all Reed-Solomon codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2076","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-18T03:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWA66bDeyt7CCa1jozt8DKYD/LUKJK7yxoAKC85P0ITzQLkVjJLJFin+S0j1/dvyA5BQilAu7X2+yfBd7o+0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:39:09.474737Z"},"content_sha256":"74932e995bf69cc940535e962e0858879760994ea52848ab40cf9755ecde8a0e","schema_version":"1.0","event_id":"sha256:74932e995bf69cc940535e962e0858879760994ea52848ab40cf9755ecde8a0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJZSDADCZFFFOVIBABDK4RNCCT/bundle.json","state_url":"https://pith.science/pith/OJZSDADCZFFFOVIBABDK4RNCCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJZSDADCZFFFOVIBABDK4RNCCT/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-07-01T22:39:09Z","links":{"resolver":"https://pith.science/pith/OJZSDADCZFFFOVIBABDK4RNCCT","bundle":"https://pith.science/pith/OJZSDADCZFFFOVIBABDK4RNCCT/bundle.json","state":"https://pith.science/pith/OJZSDADCZFFFOVIBABDK4RNCCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJZSDADCZFFFOVIBABDK4RNCCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OJZSDADCZFFFOVIBABDK4RNCCT","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":"02cdec5039b5f1a412764dbd89f1a89e68dba2f18c5a445867d62e77b2eb5d9c","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T02:05:44Z","title_canon_sha256":"94cbe3a8f03b88030296b8cc851a68cb667f022941bf718dbfe4ea491027ebd1"},"schema_version":"1.0","source":{"id":"1208.2076","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2076","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2076v2","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2076","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"OJZSDADCZFFF","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OJZSDADCZFFFOVIB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OJZSDADC","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:74932e995bf69cc940535e962e0858879760994ea52848ab40cf9755ecde8a0e","target":"graph","created_at":"2026-05-18T03:06:32Z","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":"Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study upper bounds for separating codes. First, some new upper bound for restricted separating codes is proposed. Then we illustrate that the Upper Bound Conjecture for separating Reed-Solomon codes inherited from Silverberg's question holds true for almost all Reed-Solomon codes.","authors_text":"Myong-Son Sin, Ok-Hyon Song, Ryul Kim","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T02:05:44Z","title":"Upper Bounds on the Number of Codewords of Some Separating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2076","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:fe7f8051fd7d9207c6318cc0198931954e42d631815f21ffc144df31c65f224e","target":"record","created_at":"2026-05-18T03:06:32Z","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":"02cdec5039b5f1a412764dbd89f1a89e68dba2f18c5a445867d62e77b2eb5d9c","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T02:05:44Z","title_canon_sha256":"94cbe3a8f03b88030296b8cc851a68cb667f022941bf718dbfe4ea491027ebd1"},"schema_version":"1.0","source":{"id":"1208.2076","kind":"arxiv","version":2}},"canonical_sha256":"7273218062c94a5755010046ae45a214cbb762cdb6b18a017395e9a27b823517","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7273218062c94a5755010046ae45a214cbb762cdb6b18a017395e9a27b823517","first_computed_at":"2026-05-18T03:06:32.870567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:32.870567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3mFleUZ+AKokU8xJYISBcBOCtxoQ3ICZkE8lrw9rNYlYFbW54VoQob7ZoytxEAYQhu/t6R7uP1SJIW+S5efQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:32.871031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2076","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe7f8051fd7d9207c6318cc0198931954e42d631815f21ffc144df31c65f224e","sha256:74932e995bf69cc940535e962e0858879760994ea52848ab40cf9755ecde8a0e"],"state_sha256":"32c677aff8fe529e9825e4bc10d9eb7be9051a8458638042d248834500e6af99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8JgG7lZyJB+q5ZwQoQ4Vt/5bb0QilkaQ3diDaxH2U54woLHYKTo/iE65ZZWowUKbMcq13HSAyllcIGOLnGtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T22:39:09.477954Z","bundle_sha256":"22d89e357da675252b217b17fef057d28ea4998c57e8e4cb5e5dfd3ec42a7101"}}