{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HVS6FYREUM6SOD37TXAGXT4D5J","short_pith_number":"pith:HVS6FYRE","canonical_record":{"source":{"id":"1204.1957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-09T19:38:58Z","cross_cats_sorted":[],"title_canon_sha256":"fc95d147eb5d8937a63596f98e2b1ae7c16301cf1e18744572bf3bb638559495","abstract_canon_sha256":"51d548fcbebf3437d0ba138b4be34173e46d4ea122d571c5ef16ea3c1c2b5df8"},"schema_version":"1.0"},"canonical_sha256":"3d65e2e224a33d270f7f9dc06bcf83ea67c8e39c434edfea5d20e68e8616dd5f","source":{"kind":"arxiv","id":"1204.1957","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1957","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1957v2","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1957","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"HVS6FYREUM6S","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HVS6FYREUM6SOD37","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HVS6FYRE","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HVS6FYREUM6SOD37TXAGXT4D5J","target":"record","payload":{"canonical_record":{"source":{"id":"1204.1957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-09T19:38:58Z","cross_cats_sorted":[],"title_canon_sha256":"fc95d147eb5d8937a63596f98e2b1ae7c16301cf1e18744572bf3bb638559495","abstract_canon_sha256":"51d548fcbebf3437d0ba138b4be34173e46d4ea122d571c5ef16ea3c1c2b5df8"},"schema_version":"1.0"},"canonical_sha256":"3d65e2e224a33d270f7f9dc06bcf83ea67c8e39c434edfea5d20e68e8616dd5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:15.630255Z","signature_b64":"8k3oH/6Tq7giupzWEMBF1CQ0iCkw+jxCBfJiyYYvvz2R0+kFdU5EQHD8b7D6CyOkrWojG7XBokRQcECHcrkhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d65e2e224a33d270f7f9dc06bcf83ea67c8e39c434edfea5d20e68e8616dd5f","last_reissued_at":"2026-05-18T03:57:15.629286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:15.629286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.1957","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:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0qjpKeWG/SLA3/BELD+RShSVN2sJC/S/GehQulRnOjWWpE1aZgklepcyrqTsEnwDW/MzujuG3d3NFGxebz5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:09:13.347122Z"},"content_sha256":"97a4e380689b4a69fa330b543e7109f1ed08e29dcc8f1ed1df2d542a3d3cfcf5","schema_version":"1.0","event_id":"sha256:97a4e380689b4a69fa330b543e7109f1ed08e29dcc8f1ed1df2d542a3d3cfcf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HVS6FYREUM6SOD37TXAGXT4D5J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Succinct Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Patrick K. Nicholson","submitted_at":"2012-04-09T19:38:58Z","abstract_excerpt":"We describe an algorithm for compressing a partially ordered set, or \\emph{poset}, so that it occupies space matching the information theory lower bound (to within lower order terms), in the worst case. Using this algorithm, we design a succinct data structure for representing a poset that, given two elements, can report whether one precedes the other in constant time. This is equivalent to succinctly representing the transitive closure graph of the poset, and we note that the same method can also be used to succinctly represent the transitive reduction graph. For an $n$ element poset, the dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1957","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:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQPOr/cR71BrhrMn830RLv5VJU+tspIXp90DHWX5tORDlWlnrPyPRDUiAv6Bs5ri6tq6sIgv4b15zgLYF0eCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:09:13.347784Z"},"content_sha256":"41a181d130aa05f0a24f8d41abc1fc10f1c808d8bdffaf1b2b485f7b4012c823","schema_version":"1.0","event_id":"sha256:41a181d130aa05f0a24f8d41abc1fc10f1c808d8bdffaf1b2b485f7b4012c823"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVS6FYREUM6SOD37TXAGXT4D5J/bundle.json","state_url":"https://pith.science/pith/HVS6FYREUM6SOD37TXAGXT4D5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVS6FYREUM6SOD37TXAGXT4D5J/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-28T23:09:13Z","links":{"resolver":"https://pith.science/pith/HVS6FYREUM6SOD37TXAGXT4D5J","bundle":"https://pith.science/pith/HVS6FYREUM6SOD37TXAGXT4D5J/bundle.json","state":"https://pith.science/pith/HVS6FYREUM6SOD37TXAGXT4D5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVS6FYREUM6SOD37TXAGXT4D5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HVS6FYREUM6SOD37TXAGXT4D5J","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":"51d548fcbebf3437d0ba138b4be34173e46d4ea122d571c5ef16ea3c1c2b5df8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-09T19:38:58Z","title_canon_sha256":"fc95d147eb5d8937a63596f98e2b1ae7c16301cf1e18744572bf3bb638559495"},"schema_version":"1.0","source":{"id":"1204.1957","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1957","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1957v2","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1957","created_at":"2026-05-18T03:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"HVS6FYREUM6S","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HVS6FYREUM6SOD37","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HVS6FYRE","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:41a181d130aa05f0a24f8d41abc1fc10f1c808d8bdffaf1b2b485f7b4012c823","target":"graph","created_at":"2026-05-18T03:57:15Z","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 describe an algorithm for compressing a partially ordered set, or \\emph{poset}, so that it occupies space matching the information theory lower bound (to within lower order terms), in the worst case. Using this algorithm, we design a succinct data structure for representing a poset that, given two elements, can report whether one precedes the other in constant time. This is equivalent to succinctly representing the transitive closure graph of the poset, and we note that the same method can also be used to succinctly represent the transitive reduction graph. For an $n$ element poset, the dat","authors_text":"J. Ian Munro, Patrick K. Nicholson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-09T19:38:58Z","title":"Succinct Posets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1957","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:97a4e380689b4a69fa330b543e7109f1ed08e29dcc8f1ed1df2d542a3d3cfcf5","target":"record","created_at":"2026-05-18T03:57:15Z","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":"51d548fcbebf3437d0ba138b4be34173e46d4ea122d571c5ef16ea3c1c2b5df8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-09T19:38:58Z","title_canon_sha256":"fc95d147eb5d8937a63596f98e2b1ae7c16301cf1e18744572bf3bb638559495"},"schema_version":"1.0","source":{"id":"1204.1957","kind":"arxiv","version":2}},"canonical_sha256":"3d65e2e224a33d270f7f9dc06bcf83ea67c8e39c434edfea5d20e68e8616dd5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d65e2e224a33d270f7f9dc06bcf83ea67c8e39c434edfea5d20e68e8616dd5f","first_computed_at":"2026-05-18T03:57:15.629286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:15.629286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8k3oH/6Tq7giupzWEMBF1CQ0iCkw+jxCBfJiyYYvvz2R0+kFdU5EQHD8b7D6CyOkrWojG7XBokRQcECHcrkhDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:15.630255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1957","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97a4e380689b4a69fa330b543e7109f1ed08e29dcc8f1ed1df2d542a3d3cfcf5","sha256:41a181d130aa05f0a24f8d41abc1fc10f1c808d8bdffaf1b2b485f7b4012c823"],"state_sha256":"f180a74ee079f3d5ea6df1f281ee9696ab186c883bccc0060831fcc2aae86786"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qcf3Qsw8tSAZtuxqSQBuzlYIL04BMe2NxgZJlWNZB62QI1DR7XlNuFvu7XVEKJ3ml0r5xf84F7YWnV/qnHohDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:09:13.351739Z","bundle_sha256":"45ea1a414a7b92d05c2407be7a8983e83a8b2e94431a53260d399cad90b9f7a9"}}