{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FILI4XE5SB42LUV6IP5H2GU4KQ","short_pith_number":"pith:FILI4XE5","canonical_record":{"source":{"id":"1708.06866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T01:51:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"271505df236cd2eaaaf7d09b9419767cbc92f7e09437868ac50fabbac46a711c","abstract_canon_sha256":"d5dabdfcf41459b8167b98f61fe59a35dbba191353223e5e60e1196f99a1740d"},"schema_version":"1.0"},"canonical_sha256":"2a168e5c9d9079a5d2be43fa7d1a9c541028724002a294162c02ea2e934fa8b7","source":{"kind":"arxiv","id":"1708.06866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06866","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06866v1","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06866","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"FILI4XE5SB42","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FILI4XE5SB42LUV6","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FILI4XE5","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FILI4XE5SB42LUV6IP5H2GU4KQ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T01:51:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"271505df236cd2eaaaf7d09b9419767cbc92f7e09437868ac50fabbac46a711c","abstract_canon_sha256":"d5dabdfcf41459b8167b98f61fe59a35dbba191353223e5e60e1196f99a1740d"},"schema_version":"1.0"},"canonical_sha256":"2a168e5c9d9079a5d2be43fa7d1a9c541028724002a294162c02ea2e934fa8b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:56.900467Z","signature_b64":"Sbv2UbdQ83pehr0sN03oYsTNQvO38RL0I3G0FoYkLdQDlKR7aq71g7dpTYSbkSfYqNdAi20tT2uuD+j9CLKMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a168e5c9d9079a5d2be43fa7d1a9c541028724002a294162c02ea2e934fa8b7","last_reissued_at":"2026-05-18T00:21:56.899849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:56.899849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06866","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-05-18T00:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HK3PyWYJOzGwDODZJfD5D9bkwhb0OBFblO3YiXZXznWhP5zMOND3TXnqJdJtcqMqYcNY+iovEbcPviTg/VlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:17:25.524640Z"},"content_sha256":"8aececac7c4938207da7ecc18ec98c4bacef456e7c354d8d387bff6d5ec0da52","schema_version":"1.0","event_id":"sha256:8aececac7c4938207da7ecc18ec98c4bacef456e7c354d8d387bff6d5ec0da52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FILI4XE5SB42LUV6IP5H2GU4KQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Static Graph Challenge: Subgraph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Albert Reuther, Diane Staheli, Edward Kao, Jeremy Kepner, Michael Hurley, Michael Jones, Paul Monticciolo, Sanjeev Mohindra, Siddharth Samsi, Steven Smith, Vijay Gadepally, William Song","submitted_at":"2017-08-23T01:51:08Z","abstract_excerpt":"The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties. The machine learning, high performance computing, and visual analytics communities have wrestled with these difficulties for decades and developed methodologies for creating challenges to move these communities forward. The proposed Subgraph Isomorphism Graph Challenge draws upon prior challenges from machine learning, high performance computing, and visual analytics to create a graph challenge that is reflective of ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06866","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"},"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:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBEtkwVZNsS03ofJBBlD5gYjgULnlxPLb6cnnJTZRoouWUYi+pnKNJYuyW7oT4InYu7oZta8Q5cJulykLD2dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:17:25.524987Z"},"content_sha256":"55d19b51a699e9dbcf43a3fc3465cd8f9fcee97f4bebeecea944eb77dd28ea99","schema_version":"1.0","event_id":"sha256:55d19b51a699e9dbcf43a3fc3465cd8f9fcee97f4bebeecea944eb77dd28ea99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FILI4XE5SB42LUV6IP5H2GU4KQ/bundle.json","state_url":"https://pith.science/pith/FILI4XE5SB42LUV6IP5H2GU4KQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FILI4XE5SB42LUV6IP5H2GU4KQ/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-04T18:17:25Z","links":{"resolver":"https://pith.science/pith/FILI4XE5SB42LUV6IP5H2GU4KQ","bundle":"https://pith.science/pith/FILI4XE5SB42LUV6IP5H2GU4KQ/bundle.json","state":"https://pith.science/pith/FILI4XE5SB42LUV6IP5H2GU4KQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FILI4XE5SB42LUV6IP5H2GU4KQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FILI4XE5SB42LUV6IP5H2GU4KQ","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":"d5dabdfcf41459b8167b98f61fe59a35dbba191353223e5e60e1196f99a1740d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T01:51:08Z","title_canon_sha256":"271505df236cd2eaaaf7d09b9419767cbc92f7e09437868ac50fabbac46a711c"},"schema_version":"1.0","source":{"id":"1708.06866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06866","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06866v1","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06866","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"FILI4XE5SB42","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FILI4XE5SB42LUV6","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FILI4XE5","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:55d19b51a699e9dbcf43a3fc3465cd8f9fcee97f4bebeecea944eb77dd28ea99","target":"graph","created_at":"2026-05-18T00:21:56Z","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":"The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties. The machine learning, high performance computing, and visual analytics communities have wrestled with these difficulties for decades and developed methodologies for creating challenges to move these communities forward. The proposed Subgraph Isomorphism Graph Challenge draws upon prior challenges from machine learning, high performance computing, and visual analytics to create a graph challenge that is reflective of ma","authors_text":"Albert Reuther, Diane Staheli, Edward Kao, Jeremy Kepner, Michael Hurley, Michael Jones, Paul Monticciolo, Sanjeev Mohindra, Siddharth Samsi, Steven Smith, Vijay Gadepally, William Song","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T01:51:08Z","title":"Static Graph Challenge: Subgraph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06866","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:8aececac7c4938207da7ecc18ec98c4bacef456e7c354d8d387bff6d5ec0da52","target":"record","created_at":"2026-05-18T00:21:56Z","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":"d5dabdfcf41459b8167b98f61fe59a35dbba191353223e5e60e1196f99a1740d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T01:51:08Z","title_canon_sha256":"271505df236cd2eaaaf7d09b9419767cbc92f7e09437868ac50fabbac46a711c"},"schema_version":"1.0","source":{"id":"1708.06866","kind":"arxiv","version":1}},"canonical_sha256":"2a168e5c9d9079a5d2be43fa7d1a9c541028724002a294162c02ea2e934fa8b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a168e5c9d9079a5d2be43fa7d1a9c541028724002a294162c02ea2e934fa8b7","first_computed_at":"2026-05-18T00:21:56.899849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:56.899849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sbv2UbdQ83pehr0sN03oYsTNQvO38RL0I3G0FoYkLdQDlKR7aq71g7dpTYSbkSfYqNdAi20tT2uuD+j9CLKMBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:56.900467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aececac7c4938207da7ecc18ec98c4bacef456e7c354d8d387bff6d5ec0da52","sha256:55d19b51a699e9dbcf43a3fc3465cd8f9fcee97f4bebeecea944eb77dd28ea99"],"state_sha256":"7001ba09c7fb3658580bb6fb695432e7c52ab97f8ed15f2119e62c4f52e60a51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYgTK0y/0011JK8ReECCHvOfctrpRV6T0HRNUYkgdu4rfVRFrUew9CVxtxkoysXCmuPXHhvUQYMgtDWTrB7yDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:17:25.526998Z","bundle_sha256":"de4d13e87d489937260317dd80d77dbbbd7661a01ead17b6853b348270942846"}}