{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HJA42VJY7QMZH3ZKWMI5QKNH6L","short_pith_number":"pith:HJA42VJY","canonical_record":{"source":{"id":"1902.09228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-25T12:29:11Z","cross_cats_sorted":[],"title_canon_sha256":"0482b9c19fee074c6eacce6b1f49f9e1383f1ea3dccd1e4d717c199f898e5b16","abstract_canon_sha256":"a6483240b8fe9efe36af18133257fd049b975a50cf2f2ac51b04ccd6a342a6a7"},"schema_version":"1.0"},"canonical_sha256":"3a41cd5538fc1993ef2ab311d829a7f2fc23de60f025f9ae19575639284661f1","source":{"kind":"arxiv","id":"1902.09228","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09228","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09228v2","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09228","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"HJA42VJY7QMZ","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_16","alias_value":"HJA42VJY7QMZH3ZK","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_8","alias_value":"HJA42VJY","created_at":"2026-07-05T00:58:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HJA42VJY7QMZH3ZKWMI5QKNH6L","target":"record","payload":{"canonical_record":{"source":{"id":"1902.09228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-25T12:29:11Z","cross_cats_sorted":[],"title_canon_sha256":"0482b9c19fee074c6eacce6b1f49f9e1383f1ea3dccd1e4d717c199f898e5b16","abstract_canon_sha256":"a6483240b8fe9efe36af18133257fd049b975a50cf2f2ac51b04ccd6a342a6a7"},"schema_version":"1.0"},"canonical_sha256":"3a41cd5538fc1993ef2ab311d829a7f2fc23de60f025f9ae19575639284661f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:02.269599Z","signature_b64":"F19ryXK5VrPxZ15l/8K+oSzEELVrxXhbhLhe401Oq7UEx6Tr8N40oWWNqpz1Sb4uSX9JNDTZMteWo0+I5/0gCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a41cd5538fc1993ef2ab311d829a7f2fc23de60f025f9ae19575639284661f1","last_reissued_at":"2026-07-05T00:58:02.269067Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:02.269067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.09228","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-07-05T00:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wrslFuPPehZSahbY9oEzYHMPgMzbuCgvYHvx5gz5P/zRMVqR+QNBq04B5ev0CqiDXItOlnLT23vFojKc56oBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:46:55.996682Z"},"content_sha256":"9ed48769e0dad0c6ccd038f6fc16233129dfe1d94b4b243ccf8794c839a6e197","schema_version":"1.0","event_id":"sha256:9ed48769e0dad0c6ccd038f6fc16233129dfe1d94b4b243ccf8794c839a6e197"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HJA42VJY7QMZH3ZKWMI5QKNH6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Succinct Data Structures for Families of Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"H\\\"useyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti","submitted_at":"2019-02-25T12:29:11Z","abstract_excerpt":"We consider the problem of designing succinct data structures for interval graphs with $n$ vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time in the $\\Theta(\\log n)$-bit word RAM model. The degree query reports the number of incident edges to a given vertex in constant time, the adjacency query returns true if there is an edge between two vertices in constant time, the neighborhood query reports the set of all adjacent vertices in time proportional to the degree of the queried vertex, and the shortest path query returns a shortest path in time p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09228","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.09228/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmKurk+TDUePPA3D6c5yV2doDV7Q9sZ23jLpQNWXiW3G8o+ohkfSZ9dS/yYjDf777bqlpIj3oNoGxfidmVbjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:46:55.997277Z"},"content_sha256":"0714580fe2c082187fa852ab4e9683d9a4163d1bd2f50a002894a36e73da1e7f","schema_version":"1.0","event_id":"sha256:0714580fe2c082187fa852ab4e9683d9a4163d1bd2f50a002894a36e73da1e7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJA42VJY7QMZH3ZKWMI5QKNH6L/bundle.json","state_url":"https://pith.science/pith/HJA42VJY7QMZH3ZKWMI5QKNH6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJA42VJY7QMZH3ZKWMI5QKNH6L/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-08-21T23:46:55Z","links":{"resolver":"https://pith.science/pith/HJA42VJY7QMZH3ZKWMI5QKNH6L","bundle":"https://pith.science/pith/HJA42VJY7QMZH3ZKWMI5QKNH6L/bundle.json","state":"https://pith.science/pith/HJA42VJY7QMZH3ZKWMI5QKNH6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJA42VJY7QMZH3ZKWMI5QKNH6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HJA42VJY7QMZH3ZKWMI5QKNH6L","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":"a6483240b8fe9efe36af18133257fd049b975a50cf2f2ac51b04ccd6a342a6a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-25T12:29:11Z","title_canon_sha256":"0482b9c19fee074c6eacce6b1f49f9e1383f1ea3dccd1e4d717c199f898e5b16"},"schema_version":"1.0","source":{"id":"1902.09228","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09228","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09228v2","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09228","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"HJA42VJY7QMZ","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_16","alias_value":"HJA42VJY7QMZH3ZK","created_at":"2026-07-05T00:58:02Z"},{"alias_kind":"pith_short_8","alias_value":"HJA42VJY","created_at":"2026-07-05T00:58:02Z"}],"graph_snapshots":[{"event_id":"sha256:0714580fe2c082187fa852ab4e9683d9a4163d1bd2f50a002894a36e73da1e7f","target":"graph","created_at":"2026-07-05T00:58:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.09228/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of designing succinct data structures for interval graphs with $n$ vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time in the $\\Theta(\\log n)$-bit word RAM model. The degree query reports the number of incident edges to a given vertex in constant time, the adjacency query returns true if there is an edge between two vertices in constant time, the neighborhood query reports the set of all adjacent vertices in time proportional to the degree of the queried vertex, and the shortest path query returns a shortest path in time p","authors_text":"H\\\"useyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-25T12:29:11Z","title":"Succinct Data Structures for Families of Interval Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09228","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:9ed48769e0dad0c6ccd038f6fc16233129dfe1d94b4b243ccf8794c839a6e197","target":"record","created_at":"2026-07-05T00:58:02Z","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":"a6483240b8fe9efe36af18133257fd049b975a50cf2f2ac51b04ccd6a342a6a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-25T12:29:11Z","title_canon_sha256":"0482b9c19fee074c6eacce6b1f49f9e1383f1ea3dccd1e4d717c199f898e5b16"},"schema_version":"1.0","source":{"id":"1902.09228","kind":"arxiv","version":2}},"canonical_sha256":"3a41cd5538fc1993ef2ab311d829a7f2fc23de60f025f9ae19575639284661f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a41cd5538fc1993ef2ab311d829a7f2fc23de60f025f9ae19575639284661f1","first_computed_at":"2026-07-05T00:58:02.269067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:58:02.269067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F19ryXK5VrPxZ15l/8K+oSzEELVrxXhbhLhe401Oq7UEx6Tr8N40oWWNqpz1Sb4uSX9JNDTZMteWo0+I5/0gCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:58:02.269599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.09228","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ed48769e0dad0c6ccd038f6fc16233129dfe1d94b4b243ccf8794c839a6e197","sha256:0714580fe2c082187fa852ab4e9683d9a4163d1bd2f50a002894a36e73da1e7f"],"state_sha256":"f483b092ad62b906f021b7adaa29c6bdf0804789364d85b52a8c026567df2152"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGI8gcfnzPQmzdHyV7+PddCca2kbKFH+R57dKaJsCyf5+wwwXv/Y2PvyR9sBhlDqSGqAflbI7g3lr+2k+vKADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:46:56.002178Z","bundle_sha256":"fa663754c5be62682ee38077d494e849c7a7a21755e3d03099be35056b079cf5"}}