{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MQHWIAUOMN2BAHIMJU5BEAHUER","short_pith_number":"pith:MQHWIAUO","canonical_record":{"source":{"id":"2309.07381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-14T01:58:45Z","cross_cats_sorted":[],"title_canon_sha256":"932799e5107d242048bebf58fea29f2397f0e8b8a2c055c30ecb4353a6a31550","abstract_canon_sha256":"2a194f172fc4410f1d88ce8cffac401c70bdc28335a3d0b1f1d56968e6e153de"},"schema_version":"1.0"},"canonical_sha256":"640f64028e6374101d0c4d3a1200f4246dc4654ccd84501ffc7f1cb42666f4ae","source":{"kind":"arxiv","id":"2309.07381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.07381","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"2309.07381v1","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.07381","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"MQHWIAUOMN2B","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"pith_short_16","alias_value":"MQHWIAUOMN2BAHIM","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"pith_short_8","alias_value":"MQHWIAUO","created_at":"2026-07-05T06:50:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MQHWIAUOMN2BAHIMJU5BEAHUER","target":"record","payload":{"canonical_record":{"source":{"id":"2309.07381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-14T01:58:45Z","cross_cats_sorted":[],"title_canon_sha256":"932799e5107d242048bebf58fea29f2397f0e8b8a2c055c30ecb4353a6a31550","abstract_canon_sha256":"2a194f172fc4410f1d88ce8cffac401c70bdc28335a3d0b1f1d56968e6e153de"},"schema_version":"1.0"},"canonical_sha256":"640f64028e6374101d0c4d3a1200f4246dc4654ccd84501ffc7f1cb42666f4ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:50:34.746695Z","signature_b64":"+B48CrQebXteTSokxnraHMTirAECENwoVaVe0JdWjY4dc+4X9xV2EzmF3FrTSspDx2mGC8o35EoaLPGWM3gZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"640f64028e6374101d0c4d3a1200f4246dc4654ccd84501ffc7f1cb42666f4ae","last_reissued_at":"2026-07-05T06:50:34.746277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:50:34.746277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.07381","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-05T06:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5w+ERWEWCzA4HqmXns/8GxfFeF+dPnunM4GZBRFdtH/GbhqzesEzBOVplWef5thnYUPhLLCYVJgv10I/bMJsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T01:54:28.916839Z"},"content_sha256":"8cfe51118e530fe5646f8ecb23a5c45a466aa2059996ed02e0e0c7b83b04d6ec","schema_version":"1.0","event_id":"sha256:8cfe51118e530fe5646f8ecb23a5c45a466aa2059996ed02e0e0c7b83b04d6ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MQHWIAUOMN2BAHIMJU5BEAHUER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"International Competition on Graph Counting Algorithms 2023","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hidetomo Nabeshima, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato, Shuhei Denzumi, Takeru Inoue","submitted_at":"2023-09-14T01:58:45Z","abstract_excerpt":"This paper reports on the details of the International Competition on Graph Counting Algorithms (ICGCA) held in 2023. The graph counting problem is to count the subgraphs satisfying specified constraints on a given graph. The problem belongs to #P-complete, a computationally tough class. Since many essential systems in modern society, e.g., infrastructure networks, are often represented as graphs, graph counting algorithms are a key technology to efficiently scan all the subgraphs representing the feasible states of the system. In the ICGCA, contestants were asked to count the paths on a graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.07381","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/2309.07381/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-05T06:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwa4nMWJsf7tr5//bTfTgxyFa75oCIooWk8s0Y4B3HyONJtb77Y6ukC8dvMEaVYR1x6yX5IJEbHhTdeABus5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T01:54:28.917140Z"},"content_sha256":"62dde7a52f9d90d76366dc17ff21cdbffc06dda1bf33bdddaf8550094d5d6817","schema_version":"1.0","event_id":"sha256:62dde7a52f9d90d76366dc17ff21cdbffc06dda1bf33bdddaf8550094d5d6817"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQHWIAUOMN2BAHIMJU5BEAHUER/bundle.json","state_url":"https://pith.science/pith/MQHWIAUOMN2BAHIMJU5BEAHUER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQHWIAUOMN2BAHIMJU5BEAHUER/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-01T01:54:28Z","links":{"resolver":"https://pith.science/pith/MQHWIAUOMN2BAHIMJU5BEAHUER","bundle":"https://pith.science/pith/MQHWIAUOMN2BAHIMJU5BEAHUER/bundle.json","state":"https://pith.science/pith/MQHWIAUOMN2BAHIMJU5BEAHUER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQHWIAUOMN2BAHIMJU5BEAHUER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MQHWIAUOMN2BAHIMJU5BEAHUER","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":"2a194f172fc4410f1d88ce8cffac401c70bdc28335a3d0b1f1d56968e6e153de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-14T01:58:45Z","title_canon_sha256":"932799e5107d242048bebf58fea29f2397f0e8b8a2c055c30ecb4353a6a31550"},"schema_version":"1.0","source":{"id":"2309.07381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.07381","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"2309.07381v1","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.07381","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"MQHWIAUOMN2B","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"pith_short_16","alias_value":"MQHWIAUOMN2BAHIM","created_at":"2026-07-05T06:50:34Z"},{"alias_kind":"pith_short_8","alias_value":"MQHWIAUO","created_at":"2026-07-05T06:50:34Z"}],"graph_snapshots":[{"event_id":"sha256:62dde7a52f9d90d76366dc17ff21cdbffc06dda1bf33bdddaf8550094d5d6817","target":"graph","created_at":"2026-07-05T06:50:34Z","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/2309.07381/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper reports on the details of the International Competition on Graph Counting Algorithms (ICGCA) held in 2023. The graph counting problem is to count the subgraphs satisfying specified constraints on a given graph. The problem belongs to #P-complete, a computationally tough class. Since many essential systems in modern society, e.g., infrastructure networks, are often represented as graphs, graph counting algorithms are a key technology to efficiently scan all the subgraphs representing the feasible states of the system. In the ICGCA, contestants were asked to count the paths on a graph","authors_text":"Hidetomo Nabeshima, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato, Shuhei Denzumi, Takeru Inoue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-14T01:58:45Z","title":"International Competition on Graph Counting Algorithms 2023"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.07381","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:8cfe51118e530fe5646f8ecb23a5c45a466aa2059996ed02e0e0c7b83b04d6ec","target":"record","created_at":"2026-07-05T06:50:34Z","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":"2a194f172fc4410f1d88ce8cffac401c70bdc28335a3d0b1f1d56968e6e153de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-14T01:58:45Z","title_canon_sha256":"932799e5107d242048bebf58fea29f2397f0e8b8a2c055c30ecb4353a6a31550"},"schema_version":"1.0","source":{"id":"2309.07381","kind":"arxiv","version":1}},"canonical_sha256":"640f64028e6374101d0c4d3a1200f4246dc4654ccd84501ffc7f1cb42666f4ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"640f64028e6374101d0c4d3a1200f4246dc4654ccd84501ffc7f1cb42666f4ae","first_computed_at":"2026-07-05T06:50:34.746277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:50:34.746277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+B48CrQebXteTSokxnraHMTirAECENwoVaVe0JdWjY4dc+4X9xV2EzmF3FrTSspDx2mGC8o35EoaLPGWM3gZAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:50:34.746695Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.07381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cfe51118e530fe5646f8ecb23a5c45a466aa2059996ed02e0e0c7b83b04d6ec","sha256:62dde7a52f9d90d76366dc17ff21cdbffc06dda1bf33bdddaf8550094d5d6817"],"state_sha256":"45f7f1c89474ac639d7e364c12565736134328e5a109db1a38fa5c15c5c2b333"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NYmFvQX9BM6joZCFWmDgjLFZhF5q7RVZAkZJGdgHfM8Jwt1xXVZQt5kiRpevPMZcrIDOiE1rffM7CBhi2P8UDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T01:54:28.920529Z","bundle_sha256":"355ddefed23ec2aab27a44edfccedc9847dc26f61dd1d48b7d17a47a19d8f7c5"}}