{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7N5PXTCQERTJZCOPAOYIA6PS43","short_pith_number":"pith:7N5PXTCQ","canonical_record":{"source":{"id":"1301.5915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T21:39:33Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"82ce5cf7399fcab6344a96c816716ca6b553427f4749a3cf47de436fa607fdac","abstract_canon_sha256":"5d52d0e0039a16e5c166db4210835d019d90aa633edcac070e807a4bab0a15e5"},"schema_version":"1.0"},"canonical_sha256":"fb7afbcc5024669c89cf03b08079f2e6d1f5053bc4e8e9005c5dbb19498a0ed9","source":{"kind":"arxiv","id":"1301.5915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5915","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5915v1","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5915","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"pith_short_12","alias_value":"7N5PXTCQERTJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7N5PXTCQERTJZCOP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7N5PXTCQ","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7N5PXTCQERTJZCOPAOYIA6PS43","target":"record","payload":{"canonical_record":{"source":{"id":"1301.5915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T21:39:33Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"82ce5cf7399fcab6344a96c816716ca6b553427f4749a3cf47de436fa607fdac","abstract_canon_sha256":"5d52d0e0039a16e5c166db4210835d019d90aa633edcac070e807a4bab0a15e5"},"schema_version":"1.0"},"canonical_sha256":"fb7afbcc5024669c89cf03b08079f2e6d1f5053bc4e8e9005c5dbb19498a0ed9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:27.592484Z","signature_b64":"W4EfQ4QDerclseBotqYr4kUnzI9zJxtlj8i4KIVXzAYmQi7m+CjR083MBlY4tLRgeZMAUNasbsGRc4kqdPkdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb7afbcc5024669c89cf03b08079f2e6d1f5053bc4e8e9005c5dbb19498a0ed9","last_reissued_at":"2026-05-18T03:35:27.591962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:27.591962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.5915","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-18T03:35:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiyZ9pb02K9FORjDhPemkce49kqIoCiZWhDanRoRxTa+86WAcNfFcpJeXws/YDqVn8KgKsRLATq7IEFSX3aiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T17:56:48.537944Z"},"content_sha256":"693f995d9170288d56acac4eb9d92775e41bdf9788747fb447158200fcf97680","schema_version":"1.0","event_id":"sha256:693f995d9170288d56acac4eb9d92775e41bdf9788747fb447158200fcf97680"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7N5PXTCQERTJZCOPAOYIA6PS43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Packing Radius of a Code and Partitioning Problems: the Case for Poset Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Marcelo Firer, Rafael Gregorio Lucas D'Oliveira","submitted_at":"2013-01-24T21:39:33Z","abstract_excerpt":"Until this work, the packing radius of a poset code was only known in the cases where the poset was a chain, a hierarchy, a union of disjoint chains of the same size, and for some families of codes. Our objective is to approach the general case of any poset. To do this, we will divide the problem into two parts.\n  The first part consists in finding the packing radius of a single vector. We will show that this is equivalent to a generalization of a famous NP-hard problem known as \"the partition problem\". Then, we will review the main results known about this problem giving special attention to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5915","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-18T03:35:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alNA7BxBSG86FGZFpKmtsIg9N42SuZVsno3uALWcJTxRvOSrB1vDDzIxjMvXOZRV+PYRJs5RI8gc3e5PeZfiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T17:56:48.538279Z"},"content_sha256":"2ae2178d217adb72432097451ffe2e0a568a335657ec9fdd26c4aa980f2e677e","schema_version":"1.0","event_id":"sha256:2ae2178d217adb72432097451ffe2e0a568a335657ec9fdd26c4aa980f2e677e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7N5PXTCQERTJZCOPAOYIA6PS43/bundle.json","state_url":"https://pith.science/pith/7N5PXTCQERTJZCOPAOYIA6PS43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7N5PXTCQERTJZCOPAOYIA6PS43/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-20T17:56:48Z","links":{"resolver":"https://pith.science/pith/7N5PXTCQERTJZCOPAOYIA6PS43","bundle":"https://pith.science/pith/7N5PXTCQERTJZCOPAOYIA6PS43/bundle.json","state":"https://pith.science/pith/7N5PXTCQERTJZCOPAOYIA6PS43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7N5PXTCQERTJZCOPAOYIA6PS43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7N5PXTCQERTJZCOPAOYIA6PS43","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":"5d52d0e0039a16e5c166db4210835d019d90aa633edcac070e807a4bab0a15e5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T21:39:33Z","title_canon_sha256":"82ce5cf7399fcab6344a96c816716ca6b553427f4749a3cf47de436fa607fdac"},"schema_version":"1.0","source":{"id":"1301.5915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5915","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5915v1","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5915","created_at":"2026-05-18T03:35:27Z"},{"alias_kind":"pith_short_12","alias_value":"7N5PXTCQERTJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7N5PXTCQERTJZCOP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7N5PXTCQ","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:2ae2178d217adb72432097451ffe2e0a568a335657ec9fdd26c4aa980f2e677e","target":"graph","created_at":"2026-05-18T03:35:27Z","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":"Until this work, the packing radius of a poset code was only known in the cases where the poset was a chain, a hierarchy, a union of disjoint chains of the same size, and for some families of codes. Our objective is to approach the general case of any poset. To do this, we will divide the problem into two parts.\n  The first part consists in finding the packing radius of a single vector. We will show that this is equivalent to a generalization of a famous NP-hard problem known as \"the partition problem\". Then, we will review the main results known about this problem giving special attention to ","authors_text":"Marcelo Firer, Rafael Gregorio Lucas D'Oliveira","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T21:39:33Z","title":"The Packing Radius of a Code and Partitioning Problems: the Case for Poset Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5915","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:693f995d9170288d56acac4eb9d92775e41bdf9788747fb447158200fcf97680","target":"record","created_at":"2026-05-18T03:35:27Z","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":"5d52d0e0039a16e5c166db4210835d019d90aa633edcac070e807a4bab0a15e5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-24T21:39:33Z","title_canon_sha256":"82ce5cf7399fcab6344a96c816716ca6b553427f4749a3cf47de436fa607fdac"},"schema_version":"1.0","source":{"id":"1301.5915","kind":"arxiv","version":1}},"canonical_sha256":"fb7afbcc5024669c89cf03b08079f2e6d1f5053bc4e8e9005c5dbb19498a0ed9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb7afbcc5024669c89cf03b08079f2e6d1f5053bc4e8e9005c5dbb19498a0ed9","first_computed_at":"2026-05-18T03:35:27.591962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:27.591962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W4EfQ4QDerclseBotqYr4kUnzI9zJxtlj8i4KIVXzAYmQi7m+CjR083MBlY4tLRgeZMAUNasbsGRc4kqdPkdDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:27.592484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:693f995d9170288d56acac4eb9d92775e41bdf9788747fb447158200fcf97680","sha256:2ae2178d217adb72432097451ffe2e0a568a335657ec9fdd26c4aa980f2e677e"],"state_sha256":"f9ceae2e82b2cdead7dcf4f329176c27857913bc17b7ba1c40751f69e781cfe6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3I8v9zEGGQmRAYYCo2wWsIoc6O2HdhLd3nXPsim84X997pRtrgB8o0HO7s4ZPdvmago7mphoEdYrxUNOVz1ZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T17:56:48.540128Z","bundle_sha256":"507ffda1d4d3e4650cc10b3d40a9fe6c2b5398a8e257d23a0ca1f18657b43f17"}}