{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5N47TRJ22UWBIRSWAYANZJL2KK","short_pith_number":"pith:5N47TRJ2","canonical_record":{"source":{"id":"1712.01550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-05T09:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"670dba29051624b641ea4f4f557aa18730325adf531fe0afba27d1734d23250b","abstract_canon_sha256":"608e164dd7ee2ba9b5b2d201e4de1a57cb94cb6a4ee2a75fb5377942b6dcf7de"},"schema_version":"1.0"},"canonical_sha256":"eb79f9c53ad52c1446560600dca57a52a877d7867a80cb04cd388ae20275a11b","source":{"kind":"arxiv","id":"1712.01550","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01550","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01550v2","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01550","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"pith_short_12","alias_value":"5N47TRJ22UWB","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5N47TRJ22UWBIRSW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5N47TRJ2","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5N47TRJ22UWBIRSWAYANZJL2KK","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-05T09:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"670dba29051624b641ea4f4f557aa18730325adf531fe0afba27d1734d23250b","abstract_canon_sha256":"608e164dd7ee2ba9b5b2d201e4de1a57cb94cb6a4ee2a75fb5377942b6dcf7de"},"schema_version":"1.0"},"canonical_sha256":"eb79f9c53ad52c1446560600dca57a52a877d7867a80cb04cd388ae20275a11b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:40.070350Z","signature_b64":"fY4t8jziUiV8+ufj1lh5yAQujsjEB9XvQe07ly4/xySZ/lIt7NwlhSee8f7Ms3rqqASntMz2sgqfGIFq+qlEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb79f9c53ad52c1446560600dca57a52a877d7867a80cb04cd388ae20275a11b","last_reissued_at":"2026-05-18T00:28:40.069710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:40.069710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01550","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-18T00:28:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/OxmuZNVEJFoXLZSz5dQRhjvJsqHpq654+xhLmH4Mk8daGtBMzB6aiN4vYlSA8cuQWPfVO/yp1NeM+tWBwNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:43:13.552582Z"},"content_sha256":"e328ab0379fec131e650ceda6e828848e17c81ed2df0ba705ef269ea882116ce","schema_version":"1.0","event_id":"sha256:e328ab0379fec131e650ceda6e828848e17c81ed2df0ba705ef269ea882116ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5N47TRJ22UWBIRSWAYANZJL2KK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"G-CORE: A Core for Future Graph Query Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Claudio Gutierrez, George H. L. Fletcher, Hannes Voigt, Juan Sequeda, Marcelo Arenas, Marcus Paradies, Oskar van Rest, Pablo Barcel\\'o, Peter Boncz, Renzo Angles, Stefan Plantikow, Tobias Lindaaker","submitted_at":"2017-12-05T09:59:47Z","abstract_excerpt":"We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01550","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-18T00:28:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfB2nIYmmeqRqr9T7g2L/RSYfI1N8MOmfuOwPi6DWeUUWYS0KvT2rQbP/eTiRKjUgh5M9D0THQWzlBqjc5qdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:43:13.552926Z"},"content_sha256":"728275854a0b509a53fbd9595c5c7aae1ad761c87785c0f6c4c6e4375ea299ee","schema_version":"1.0","event_id":"sha256:728275854a0b509a53fbd9595c5c7aae1ad761c87785c0f6c4c6e4375ea299ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5N47TRJ22UWBIRSWAYANZJL2KK/bundle.json","state_url":"https://pith.science/pith/5N47TRJ22UWBIRSWAYANZJL2KK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5N47TRJ22UWBIRSWAYANZJL2KK/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-08T12:43:13Z","links":{"resolver":"https://pith.science/pith/5N47TRJ22UWBIRSWAYANZJL2KK","bundle":"https://pith.science/pith/5N47TRJ22UWBIRSWAYANZJL2KK/bundle.json","state":"https://pith.science/pith/5N47TRJ22UWBIRSWAYANZJL2KK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5N47TRJ22UWBIRSWAYANZJL2KK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5N47TRJ22UWBIRSWAYANZJL2KK","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":"608e164dd7ee2ba9b5b2d201e4de1a57cb94cb6a4ee2a75fb5377942b6dcf7de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-05T09:59:47Z","title_canon_sha256":"670dba29051624b641ea4f4f557aa18730325adf531fe0afba27d1734d23250b"},"schema_version":"1.0","source":{"id":"1712.01550","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01550","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01550v2","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01550","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"pith_short_12","alias_value":"5N47TRJ22UWB","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5N47TRJ22UWBIRSW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5N47TRJ2","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:728275854a0b509a53fbd9595c5c7aae1ad761c87785c0f6c4c6e4375ea299ee","target":"graph","created_at":"2026-05-18T00:28:40Z","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 report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity.","authors_text":"Claudio Gutierrez, George H. L. Fletcher, Hannes Voigt, Juan Sequeda, Marcelo Arenas, Marcus Paradies, Oskar van Rest, Pablo Barcel\\'o, Peter Boncz, Renzo Angles, Stefan Plantikow, Tobias Lindaaker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-05T09:59:47Z","title":"G-CORE: A Core for Future Graph Query Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01550","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:e328ab0379fec131e650ceda6e828848e17c81ed2df0ba705ef269ea882116ce","target":"record","created_at":"2026-05-18T00:28:40Z","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":"608e164dd7ee2ba9b5b2d201e4de1a57cb94cb6a4ee2a75fb5377942b6dcf7de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-05T09:59:47Z","title_canon_sha256":"670dba29051624b641ea4f4f557aa18730325adf531fe0afba27d1734d23250b"},"schema_version":"1.0","source":{"id":"1712.01550","kind":"arxiv","version":2}},"canonical_sha256":"eb79f9c53ad52c1446560600dca57a52a877d7867a80cb04cd388ae20275a11b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb79f9c53ad52c1446560600dca57a52a877d7867a80cb04cd388ae20275a11b","first_computed_at":"2026-05-18T00:28:40.069710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:40.069710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fY4t8jziUiV8+ufj1lh5yAQujsjEB9XvQe07ly4/xySZ/lIt7NwlhSee8f7Ms3rqqASntMz2sgqfGIFq+qlEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:40.070350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01550","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e328ab0379fec131e650ceda6e828848e17c81ed2df0ba705ef269ea882116ce","sha256:728275854a0b509a53fbd9595c5c7aae1ad761c87785c0f6c4c6e4375ea299ee"],"state_sha256":"31e62536a365a7bf766c8b94f19891c17f76aa6d8ff37f896c0686e475ef1847"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlwyKzWtUpJZhuiF+WNmI1ozQENoPs7utHscuTzcrZip5PKaTmyMSrAFjdVEvgjYeU+kAoIY0ZgxMnGEZd6GDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:43:13.554800Z","bundle_sha256":"ef686c0e72ed617edbb766de481162e067baa64dec5eadfc360ffd01ad603760"}}