{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:EUU2QYOKOUM763QZNNL2OI55DS","short_pith_number":"pith:EUU2QYOK","canonical_record":{"source":{"id":"0710.1525","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-08T12:15:48Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e6fc4f20781615794838c22c2366650e47c4850dc7dfbce88e683393d9d92e80","abstract_canon_sha256":"110717acd9c976c067dd3ed58fa18332fd5470537c64de438ad7fa53a8e032e9"},"schema_version":"1.0"},"canonical_sha256":"2529a861ca7519ff6e196b57a723bd1cb30679821148d4016db1f6a22aa02b58","source":{"kind":"arxiv","id":"0710.1525","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.1525","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"arxiv_version","alias_value":"0710.1525v2","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.1525","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"pith_short_12","alias_value":"EUU2QYOKOUM7","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"EUU2QYOKOUM763QZ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"EUU2QYOK","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:EUU2QYOKOUM763QZNNL2OI55DS","target":"record","payload":{"canonical_record":{"source":{"id":"0710.1525","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-08T12:15:48Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e6fc4f20781615794838c22c2366650e47c4850dc7dfbce88e683393d9d92e80","abstract_canon_sha256":"110717acd9c976c067dd3ed58fa18332fd5470537c64de438ad7fa53a8e032e9"},"schema_version":"1.0"},"canonical_sha256":"2529a861ca7519ff6e196b57a723bd1cb30679821148d4016db1f6a22aa02b58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:29.944452Z","signature_b64":"nDs953/mA2KUQNSful8TMVqd9ahg5ib5z2mnPsKwJcX2h9bSYCdCKUQ9uyfaU54nmHIYg/0lTF05lAC+PIQ4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2529a861ca7519ff6e196b57a723bd1cb30679821148d4016db1f6a22aa02b58","last_reissued_at":"2026-05-18T01:09:29.943952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:29.943952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0710.1525","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-18T01:09:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMlugkyc2I6ETAIIP59IwzwqsieH0A7e5qe1b33wG6O7I1JDrzhoKX6WjORBwxlpL0IeqXG8Z2GkdyVU4bZXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:09:09.918799Z"},"content_sha256":"e87ec1f624b4f6e48473dcf6fceb59427d608033bf45392fc7f4ab65917d1df9","schema_version":"1.0","event_id":"sha256:e87ec1f624b4f6e48473dcf6fceb59427d608033bf45392fc7f4ab65917d1df9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:EUU2QYOKOUM763QZNNL2OI55DS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Paolo Boldi, Sebastiano Vigna","submitted_at":"2007-10-08T12:15:48Z","abstract_excerpt":"Minimal-interval semantics associates with each query over a document a set of intervals, called witnesses, that are incomparable with respect to inclusion (i.e., they form an antichain): witnesses define the minimal regions of the document satisfying the query. Minimal-interval semantics makes it easy to define and compute several sophisticated proximity operators, provides snippets for user presentation, and can be used to rank documents. In this paper we provide algorithms for computing conjunction and disjunction that are linear in the number of intervals and logarithmic in the number of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.1525","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-18T01:09:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CAdPaYn/Z/QhlIwSVb76YdDiu+ls+fxH93CqSXYssSN/C6iLm60zH+RCDP5GOpIPmagaNI2PhRZ+/cUgmEqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:09:09.919156Z"},"content_sha256":"c83a16391dd2cd9af209109a9a230065dc83d632ab81327f8e1a2065798f5088","schema_version":"1.0","event_id":"sha256:c83a16391dd2cd9af209109a9a230065dc83d632ab81327f8e1a2065798f5088"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUU2QYOKOUM763QZNNL2OI55DS/bundle.json","state_url":"https://pith.science/pith/EUU2QYOKOUM763QZNNL2OI55DS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUU2QYOKOUM763QZNNL2OI55DS/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-10T21:09:09Z","links":{"resolver":"https://pith.science/pith/EUU2QYOKOUM763QZNNL2OI55DS","bundle":"https://pith.science/pith/EUU2QYOKOUM763QZNNL2OI55DS/bundle.json","state":"https://pith.science/pith/EUU2QYOKOUM763QZNNL2OI55DS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUU2QYOKOUM763QZNNL2OI55DS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:EUU2QYOKOUM763QZNNL2OI55DS","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":"110717acd9c976c067dd3ed58fa18332fd5470537c64de438ad7fa53a8e032e9","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-08T12:15:48Z","title_canon_sha256":"e6fc4f20781615794838c22c2366650e47c4850dc7dfbce88e683393d9d92e80"},"schema_version":"1.0","source":{"id":"0710.1525","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.1525","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"arxiv_version","alias_value":"0710.1525v2","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.1525","created_at":"2026-05-18T01:09:29Z"},{"alias_kind":"pith_short_12","alias_value":"EUU2QYOKOUM7","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"EUU2QYOKOUM763QZ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"EUU2QYOK","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:c83a16391dd2cd9af209109a9a230065dc83d632ab81327f8e1a2065798f5088","target":"graph","created_at":"2026-05-18T01:09:29Z","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":"Minimal-interval semantics associates with each query over a document a set of intervals, called witnesses, that are incomparable with respect to inclusion (i.e., they form an antichain): witnesses define the minimal regions of the document satisfying the query. Minimal-interval semantics makes it easy to define and compute several sophisticated proximity operators, provides snippets for user presentation, and can be used to rank documents. In this paper we provide algorithms for computing conjunction and disjunction that are linear in the number of intervals and logarithmic in the number of o","authors_text":"Paolo Boldi, Sebastiano Vigna","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-08T12:15:48Z","title":"Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.1525","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:e87ec1f624b4f6e48473dcf6fceb59427d608033bf45392fc7f4ab65917d1df9","target":"record","created_at":"2026-05-18T01:09:29Z","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":"110717acd9c976c067dd3ed58fa18332fd5470537c64de438ad7fa53a8e032e9","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-08T12:15:48Z","title_canon_sha256":"e6fc4f20781615794838c22c2366650e47c4850dc7dfbce88e683393d9d92e80"},"schema_version":"1.0","source":{"id":"0710.1525","kind":"arxiv","version":2}},"canonical_sha256":"2529a861ca7519ff6e196b57a723bd1cb30679821148d4016db1f6a22aa02b58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2529a861ca7519ff6e196b57a723bd1cb30679821148d4016db1f6a22aa02b58","first_computed_at":"2026-05-18T01:09:29.943952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:29.943952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nDs953/mA2KUQNSful8TMVqd9ahg5ib5z2mnPsKwJcX2h9bSYCdCKUQ9uyfaU54nmHIYg/0lTF05lAC+PIQ4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:29.944452Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.1525","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e87ec1f624b4f6e48473dcf6fceb59427d608033bf45392fc7f4ab65917d1df9","sha256:c83a16391dd2cd9af209109a9a230065dc83d632ab81327f8e1a2065798f5088"],"state_sha256":"1af2f7191e101934770d8b3da7faaca745c66f24497dbc527f775e13134cdfba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cXJvepSh7UrA/PL+xFniMHa2Vcwd1MXfTO8sqR0G1d/2se55zpXWwBYTwTYZdX8jdaWt8CioLGowW1fjI1N3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:09:09.921265Z","bundle_sha256":"37de1f540d3e142c3c7b4a03e05e280d3eb14c8660e524ba88435b7d77f0dd8e"}}