{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TJONVCQFVO4WZGAFVV5JAO4ZJS","short_pith_number":"pith:TJONVCQF","canonical_record":{"source":{"id":"1305.4760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-21T09:17:16Z","cross_cats_sorted":["cs.DS","physics.soc-ph","q-bio.QM"],"title_canon_sha256":"30d9219a41c82b54b102cebd0ff83c59834fffbfc34bd11e556301112c4477e4","abstract_canon_sha256":"f125c6e925d4a660d01598bc2c20f7f8e4c7c5e4e833fb800951fdd94c38c04b"},"schema_version":"1.0"},"canonical_sha256":"9a5cda8a05abb96c9805ad7a903b994c8dcf22e17c478581a196f3bd64a80f0f","source":{"kind":"arxiv","id":"1305.4760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4760","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4760v1","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4760","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"pith_short_12","alias_value":"TJONVCQFVO4W","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TJONVCQFVO4WZGAF","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TJONVCQF","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TJONVCQFVO4WZGAFVV5JAO4ZJS","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-21T09:17:16Z","cross_cats_sorted":["cs.DS","physics.soc-ph","q-bio.QM"],"title_canon_sha256":"30d9219a41c82b54b102cebd0ff83c59834fffbfc34bd11e556301112c4477e4","abstract_canon_sha256":"f125c6e925d4a660d01598bc2c20f7f8e4c7c5e4e833fb800951fdd94c38c04b"},"schema_version":"1.0"},"canonical_sha256":"9a5cda8a05abb96c9805ad7a903b994c8dcf22e17c478581a196f3bd64a80f0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:15.276806Z","signature_b64":"dH8bDCitFUXFjFD0BupzaiRlfP/OGNY6ErMI77qxNzxc/fUQwNWT/PInt0EOXzc6pdwGAcLIMgZtRV/ofTFGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a5cda8a05abb96c9805ad7a903b994c8dcf22e17c478581a196f3bd64a80f0f","last_reissued_at":"2026-05-18T03:25:15.276282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:15.276282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4760","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-18T03:25:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kTEHpp4h1htDFEAs29UULpXJwFOVmC+xMph1FQXVc4wEA4nugEJQ+polnJ7ihy4xa4Y4IUH8sa0+zw754bkuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:52:37.083185Z"},"content_sha256":"4a60dd52f76c897ff5b63fe3428067d2c554de03cce67a184a8bb849e69792b5","schema_version":"1.0","event_id":"sha256:4a60dd52f76c897ff5b63fe3428067d2c554de03cce67a184a8bb849e69792b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TJONVCQFVO4WZGAFVV5JAO4ZJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How modular structure can simplify tasks on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph","q-bio.QM"],"primary_cat":"cs.SI","authors_text":"Binh-Minh Bui-Xuan, Nick S. Jones","submitted_at":"2013-05-21T09:17:16Z","abstract_excerpt":"By considering the task of finding the shortest walk through a network we find an algorithm for which the run time is not as O(2^n), with n being the number of nodes, but instead scales with the number of nodes in a coarsened network. This coarsened network has a number of nodes related to the number of dense regions in the original graph. Since we exploit a form of local community detection as a preprocessing, this work gives support to the project of developing heuristic algorithms for detecting dense regions in networks: preprocessing of this kind can accelerate optimization tasks on networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4760","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-18T03:25:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EG/JGKwb0jqWDtvAFj2w+Y1MthUIykctKuO4F81m+MXxDG8SuBM435keKEhSRHRl6CzbazRZopAfuwg+uL/TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:52:37.083904Z"},"content_sha256":"296a292f6eff0fc1973811dee0f755d64e9a4d1cd30c1c612ea674d541567538","schema_version":"1.0","event_id":"sha256:296a292f6eff0fc1973811dee0f755d64e9a4d1cd30c1c612ea674d541567538"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJONVCQFVO4WZGAFVV5JAO4ZJS/bundle.json","state_url":"https://pith.science/pith/TJONVCQFVO4WZGAFVV5JAO4ZJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJONVCQFVO4WZGAFVV5JAO4ZJS/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-06T19:52:37Z","links":{"resolver":"https://pith.science/pith/TJONVCQFVO4WZGAFVV5JAO4ZJS","bundle":"https://pith.science/pith/TJONVCQFVO4WZGAFVV5JAO4ZJS/bundle.json","state":"https://pith.science/pith/TJONVCQFVO4WZGAFVV5JAO4ZJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJONVCQFVO4WZGAFVV5JAO4ZJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TJONVCQFVO4WZGAFVV5JAO4ZJS","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":"f125c6e925d4a660d01598bc2c20f7f8e4c7c5e4e833fb800951fdd94c38c04b","cross_cats_sorted":["cs.DS","physics.soc-ph","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-21T09:17:16Z","title_canon_sha256":"30d9219a41c82b54b102cebd0ff83c59834fffbfc34bd11e556301112c4477e4"},"schema_version":"1.0","source":{"id":"1305.4760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4760","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4760v1","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4760","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"pith_short_12","alias_value":"TJONVCQFVO4W","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TJONVCQFVO4WZGAF","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TJONVCQF","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:296a292f6eff0fc1973811dee0f755d64e9a4d1cd30c1c612ea674d541567538","target":"graph","created_at":"2026-05-18T03:25:15Z","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":"By considering the task of finding the shortest walk through a network we find an algorithm for which the run time is not as O(2^n), with n being the number of nodes, but instead scales with the number of nodes in a coarsened network. This coarsened network has a number of nodes related to the number of dense regions in the original graph. Since we exploit a form of local community detection as a preprocessing, this work gives support to the project of developing heuristic algorithms for detecting dense regions in networks: preprocessing of this kind can accelerate optimization tasks on networ","authors_text":"Binh-Minh Bui-Xuan, Nick S. Jones","cross_cats":["cs.DS","physics.soc-ph","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-21T09:17:16Z","title":"How modular structure can simplify tasks on networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4760","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:4a60dd52f76c897ff5b63fe3428067d2c554de03cce67a184a8bb849e69792b5","target":"record","created_at":"2026-05-18T03:25:15Z","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":"f125c6e925d4a660d01598bc2c20f7f8e4c7c5e4e833fb800951fdd94c38c04b","cross_cats_sorted":["cs.DS","physics.soc-ph","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-05-21T09:17:16Z","title_canon_sha256":"30d9219a41c82b54b102cebd0ff83c59834fffbfc34bd11e556301112c4477e4"},"schema_version":"1.0","source":{"id":"1305.4760","kind":"arxiv","version":1}},"canonical_sha256":"9a5cda8a05abb96c9805ad7a903b994c8dcf22e17c478581a196f3bd64a80f0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a5cda8a05abb96c9805ad7a903b994c8dcf22e17c478581a196f3bd64a80f0f","first_computed_at":"2026-05-18T03:25:15.276282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:15.276282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dH8bDCitFUXFjFD0BupzaiRlfP/OGNY6ErMI77qxNzxc/fUQwNWT/PInt0EOXzc6pdwGAcLIMgZtRV/ofTFGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:15.276806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a60dd52f76c897ff5b63fe3428067d2c554de03cce67a184a8bb849e69792b5","sha256:296a292f6eff0fc1973811dee0f755d64e9a4d1cd30c1c612ea674d541567538"],"state_sha256":"33b4916617b4205f62333574ed0541fc7abefdc84ab69670771be84f8cca0b5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubsThXCqKQilCo3H5QCgj9mh+HVvxk5CpbNyx+1NdAgbM6iXHXj2awCSwsf61gRE2i4Z9aI4sQSKmzQh8v9UBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:52:37.089213Z","bundle_sha256":"0ddcf8a9e7c0634cf8a80399f8a8b1cea36d13000f4ff28e320ff8c8db36069b"}}