{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ULF6KF2276TGHXAQOMXA3WFCA7","short_pith_number":"pith:ULF6KF22","schema_version":"1.0","canonical_sha256":"a2cbe5175affa663dc10732e0dd8a207d8a6a20e0818e63b9aa20f35ecb527d6","source":{"kind":"arxiv","id":"1306.2460","version":1},"attestation_state":"computed","paper":{"title":"StreamWorks - A system for Dynamic Graph Search","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Abhik Ray, George Chin, John Feo, Lawrence Holder, Sherman Beus, Sutanay Choudhury","submitted_at":"2013-06-11T09:24:06Z","abstract_excerpt":"Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1306.2460","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DB","submitted_at":"2013-06-11T09:24:06Z","cross_cats_sorted":[],"title_canon_sha256":"b84a009686819c37ef8ce267637a9330586bb9a429cdba27a2b437fc971b171c","abstract_canon_sha256":"d9866f3d7baa09515f3c99361824d91db617956ed534213195dcd11fabac89bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:11.321203Z","signature_b64":"YU1lI0bV7fe/3vLQDPm1b+wOCQGIY61EsGKMxDFB50r9kzxY5YZsbqT2Yp42pJREgd9AWFNYEWd4Th1ycpdhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2cbe5175affa663dc10732e0dd8a207d8a6a20e0818e63b9aa20f35ecb527d6","last_reissued_at":"2026-05-18T03:21:11.320653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:11.320653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"StreamWorks - A system for Dynamic Graph Search","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Abhik Ray, George Chin, John Feo, Lawrence Holder, Sherman Beus, Sutanay Choudhury","submitted_at":"2013-06-11T09:24:06Z","abstract_excerpt":"Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2460","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.2460","created_at":"2026-05-18T03:21:11.320742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2460v1","created_at":"2026-05-18T03:21:11.320742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2460","created_at":"2026-05-18T03:21:11.320742+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULF6KF2276TG","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULF6KF2276TGHXAQ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULF6KF22","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULF6KF2276TGHXAQOMXA3WFCA7","json":"https://pith.science/pith/ULF6KF2276TGHXAQOMXA3WFCA7.json","graph_json":"https://pith.science/api/pith-number/ULF6KF2276TGHXAQOMXA3WFCA7/graph.json","events_json":"https://pith.science/api/pith-number/ULF6KF2276TGHXAQOMXA3WFCA7/events.json","paper":"https://pith.science/paper/ULF6KF22"},"agent_actions":{"view_html":"https://pith.science/pith/ULF6KF2276TGHXAQOMXA3WFCA7","download_json":"https://pith.science/pith/ULF6KF2276TGHXAQOMXA3WFCA7.json","view_paper":"https://pith.science/paper/ULF6KF22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2460&json=true","fetch_graph":"https://pith.science/api/pith-number/ULF6KF2276TGHXAQOMXA3WFCA7/graph.json","fetch_events":"https://pith.science/api/pith-number/ULF6KF2276TGHXAQOMXA3WFCA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULF6KF2276TGHXAQOMXA3WFCA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULF6KF2276TGHXAQOMXA3WFCA7/action/storage_attestation","attest_author":"https://pith.science/pith/ULF6KF2276TGHXAQOMXA3WFCA7/action/author_attestation","sign_citation":"https://pith.science/pith/ULF6KF2276TGHXAQOMXA3WFCA7/action/citation_signature","submit_replication":"https://pith.science/pith/ULF6KF2276TGHXAQOMXA3WFCA7/action/replication_record"}},"created_at":"2026-05-18T03:21:11.320742+00:00","updated_at":"2026-05-18T03:21:11.320742+00:00"}