{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:YQBGVX2AU7JERJCU7VIL43NNMV","short_pith_number":"pith:YQBGVX2A","canonical_record":{"source":{"id":"cs/0007023","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CL","submitted_at":"2000-07-13T18:40:15Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"027138a9864ef343c712cc069416140475348051d7271c014854da310dd65780","abstract_canon_sha256":"54f19eff1714c442ced8d1760e8a9f1fdd12b4210db946b15723ab9dc4278409"},"schema_version":"1.0"},"canonical_sha256":"c4026adf40a7d248a454fd50be6dad657bf674b1b53b279496f16fa49f3a451c","source":{"kind":"arxiv","id":"cs/0007023","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0007023","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0007023v1","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0007023","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"YQBGVX2AU7JE","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_16","alias_value":"YQBGVX2AU7JERJCU","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_8","alias_value":"YQBGVX2A","created_at":"2026-07-04T14:24:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:YQBGVX2AU7JERJCU7VIL43NNMV","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0007023","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CL","submitted_at":"2000-07-13T18:40:15Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"027138a9864ef343c712cc069416140475348051d7271c014854da310dd65780","abstract_canon_sha256":"54f19eff1714c442ced8d1760e8a9f1fdd12b4210db946b15723ab9dc4278409"},"schema_version":"1.0"},"canonical_sha256":"c4026adf40a7d248a454fd50be6dad657bf674b1b53b279496f16fa49f3a451c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:03.568864Z","signature_b64":"tETBqpu/PArJ/tMCJ/BxyPYbK4B6iTTSFUty3rSAGIaoq/W0A3Jf2Te3mxHz00JUXAH/HAVGzxgRV3yjI/CyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4026adf40a7d248a454fd50be6dad657bf674b1b53b279496f16fa49f3a451c","last_reissued_at":"2026-07-04T14:24:03.568457Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:03.568457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0007023","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-07-04T14:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bkVUs/zzSdQbqEDwRLZLiX5UNf0pU8sJYSSpSDpMx+0LcP+328vBh9xFf7rWZRXMDe0Fim0r7BcfigLReptPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:29:31.563938Z"},"content_sha256":"06fd9a6f451fb3a55b787a3c746d90e47bbf855195072616c816288cd9fb094b","schema_version":"1.0","event_id":"sha256:06fd9a6f451fb3a55b787a3c746d90e47bbf855195072616c816288cd9fb094b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:YQBGVX2AU7JERJCU7VIL43NNMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a query language for annotation graphs","license":"","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CL","authors_text":"Peter Buneman, Steven Bird, Wang-Chiew Tan","submitted_at":"2000-07-13T18:40:15Z","abstract_excerpt":"The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been proposed as a general-purpose representational framework for speech databases. Typical queries on annotation graphs require path expressions similar to those used in semistructured query languages. However, the underlying model is rather different from the customary graph models for semistructured data: the graph is acyclic and unrooted, and both temporal and inclusion relationships are important. We develop a query langu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0007023","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0007023/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-04T14:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBY+OL8M6BjWAv5if65S4TPZNggcMPkMbeLeZD32OyACsYpITJKNVSrwxsFdsy2n7TbE7Pw8wRrwO3b0Tj74Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:29:31.564667Z"},"content_sha256":"86a0f961f38a166812637d0f32a3d6305c631eae0c937bd7188e89c17a004897","schema_version":"1.0","event_id":"sha256:86a0f961f38a166812637d0f32a3d6305c631eae0c937bd7188e89c17a004897"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQBGVX2AU7JERJCU7VIL43NNMV/bundle.json","state_url":"https://pith.science/pith/YQBGVX2AU7JERJCU7VIL43NNMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQBGVX2AU7JERJCU7VIL43NNMV/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-04T22:29:31Z","links":{"resolver":"https://pith.science/pith/YQBGVX2AU7JERJCU7VIL43NNMV","bundle":"https://pith.science/pith/YQBGVX2AU7JERJCU7VIL43NNMV/bundle.json","state":"https://pith.science/pith/YQBGVX2AU7JERJCU7VIL43NNMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQBGVX2AU7JERJCU7VIL43NNMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:YQBGVX2AU7JERJCU7VIL43NNMV","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":"54f19eff1714c442ced8d1760e8a9f1fdd12b4210db946b15723ab9dc4278409","cross_cats_sorted":["cs.DB"],"license":"","primary_cat":"cs.CL","submitted_at":"2000-07-13T18:40:15Z","title_canon_sha256":"027138a9864ef343c712cc069416140475348051d7271c014854da310dd65780"},"schema_version":"1.0","source":{"id":"cs/0007023","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0007023","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0007023v1","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0007023","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"YQBGVX2AU7JE","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_16","alias_value":"YQBGVX2AU7JERJCU","created_at":"2026-07-04T14:24:03Z"},{"alias_kind":"pith_short_8","alias_value":"YQBGVX2A","created_at":"2026-07-04T14:24:03Z"}],"graph_snapshots":[{"event_id":"sha256:86a0f961f38a166812637d0f32a3d6305c631eae0c937bd7188e89c17a004897","target":"graph","created_at":"2026-07-04T14:24:03Z","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/cs/0007023/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been proposed as a general-purpose representational framework for speech databases. Typical queries on annotation graphs require path expressions similar to those used in semistructured query languages. However, the underlying model is rather different from the customary graph models for semistructured data: the graph is acyclic and unrooted, and both temporal and inclusion relationships are important. We develop a query langu","authors_text":"Peter Buneman, Steven Bird, Wang-Chiew Tan","cross_cats":["cs.DB"],"headline":"","license":"","primary_cat":"cs.CL","submitted_at":"2000-07-13T18:40:15Z","title":"Towards a query language for annotation graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0007023","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:06fd9a6f451fb3a55b787a3c746d90e47bbf855195072616c816288cd9fb094b","target":"record","created_at":"2026-07-04T14:24:03Z","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":"54f19eff1714c442ced8d1760e8a9f1fdd12b4210db946b15723ab9dc4278409","cross_cats_sorted":["cs.DB"],"license":"","primary_cat":"cs.CL","submitted_at":"2000-07-13T18:40:15Z","title_canon_sha256":"027138a9864ef343c712cc069416140475348051d7271c014854da310dd65780"},"schema_version":"1.0","source":{"id":"cs/0007023","kind":"arxiv","version":1}},"canonical_sha256":"c4026adf40a7d248a454fd50be6dad657bf674b1b53b279496f16fa49f3a451c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4026adf40a7d248a454fd50be6dad657bf674b1b53b279496f16fa49f3a451c","first_computed_at":"2026-07-04T14:24:03.568457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:03.568457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tETBqpu/PArJ/tMCJ/BxyPYbK4B6iTTSFUty3rSAGIaoq/W0A3Jf2Te3mxHz00JUXAH/HAVGzxgRV3yjI/CyCw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:03.568864Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0007023","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06fd9a6f451fb3a55b787a3c746d90e47bbf855195072616c816288cd9fb094b","sha256:86a0f961f38a166812637d0f32a3d6305c631eae0c937bd7188e89c17a004897"],"state_sha256":"b7bee2127d0c9a14561f20f47e1fbb736e492db865c0e1143773da6d999b6bc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PzysQ3tinC+XKu40XtOh46xPR2gNOiAHiXXSYDnCBEOFxeCKhh1S7c9bWbEcUEgtwHqoJpyaFmFYf1BjdxyVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T22:29:31.571366Z","bundle_sha256":"843195befcb5b0e1bd62a5be913ebbafb32876c6c35b88fe303d3ace577dc6bc"}}