{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SHYDICVCDORKAJIMUV3ECJ6OSU","short_pith_number":"pith:SHYDICVC","canonical_record":{"source":{"id":"1512.09193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T01:27:54Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"872f7709cdc4cd9a0c3c7fa893760de7dc16d4a321961e07cf3def4ec0b69fc9","abstract_canon_sha256":"6b91d8c6ca550ce0e0b96290e950fc80c694e0c12ac74df4ccaae21f48b6a2ff"},"schema_version":"1.0"},"canonical_sha256":"91f0340aa21ba2a0250ca5764127ce950d1585543f5c9bf8e4939adf52a9ca87","source":{"kind":"arxiv","id":"1512.09193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09193","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09193v1","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09193","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"pith_short_12","alias_value":"SHYDICVCDORK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SHYDICVCDORKAJIM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SHYDICVC","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SHYDICVCDORKAJIMUV3ECJ6OSU","target":"record","payload":{"canonical_record":{"source":{"id":"1512.09193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T01:27:54Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"872f7709cdc4cd9a0c3c7fa893760de7dc16d4a321961e07cf3def4ec0b69fc9","abstract_canon_sha256":"6b91d8c6ca550ce0e0b96290e950fc80c694e0c12ac74df4ccaae21f48b6a2ff"},"schema_version":"1.0"},"canonical_sha256":"91f0340aa21ba2a0250ca5764127ce950d1585543f5c9bf8e4939adf52a9ca87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:33.057385Z","signature_b64":"2g+aO1VW8qc3n3xVu5A1FRnGD5czK0mBaunJJtxes+0Cnkhv54QG5+VxLrFOR/E7bxlnjaQ3lSnHvP+CjRZTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f0340aa21ba2a0250ca5764127ce950d1585543f5c9bf8e4939adf52a9ca87","last_reissued_at":"2026-05-18T01:23:33.056623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:33.056623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.09193","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-18T01:23:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHthLLF9hY/U14t8ckuedLqFOw4coc0waSgTFikr1tu5Q7x730uOWI60xFztcA+qGdaYsOU2iKFaKJ+tZUrxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:38:56.191008Z"},"content_sha256":"7917601daf9a706d400e601e56d303151e610734abd573d9e3e1f4627a6e23b5","schema_version":"1.0","event_id":"sha256:7917601daf9a706d400e601e56d303151e610734abd573d9e3e1f4627a6e23b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SHYDICVCDORKAJIMUV3ECJ6OSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient algorithms for topological inference on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Iuliana Teodorescu, Pranav Warman, Razvan Teodorescu","submitted_at":"2015-12-31T01:27:54Z","abstract_excerpt":"In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic graph, it belongs to the NP class of computational complexity. A typical example rich in applications is that of connectivity loss in evacuation models for natural hazards management (e.g. coastal floods, hurricanes). Algorithmically, this model reduces to solving a min-cut (or max-flow) problem, with is known to be intractable. The current work covers seve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09193","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-18T01:23:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+PR6i0MwWWaNieRJCjIaO5DWlO9diBAY2UICiP+Z1CTbXwgtK02wQ0HXBzlzLe2ngvPDGpRXGBeyV9Ro0itODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:38:56.191736Z"},"content_sha256":"88cbcda208bc544c3de065fa15a1a0b0f3780b8f195dfd020fa5be98bd48e781","schema_version":"1.0","event_id":"sha256:88cbcda208bc544c3de065fa15a1a0b0f3780b8f195dfd020fa5be98bd48e781"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHYDICVCDORKAJIMUV3ECJ6OSU/bundle.json","state_url":"https://pith.science/pith/SHYDICVCDORKAJIMUV3ECJ6OSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHYDICVCDORKAJIMUV3ECJ6OSU/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-05-26T09:38:56Z","links":{"resolver":"https://pith.science/pith/SHYDICVCDORKAJIMUV3ECJ6OSU","bundle":"https://pith.science/pith/SHYDICVCDORKAJIMUV3ECJ6OSU/bundle.json","state":"https://pith.science/pith/SHYDICVCDORKAJIMUV3ECJ6OSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHYDICVCDORKAJIMUV3ECJ6OSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SHYDICVCDORKAJIMUV3ECJ6OSU","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":"6b91d8c6ca550ce0e0b96290e950fc80c694e0c12ac74df4ccaae21f48b6a2ff","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T01:27:54Z","title_canon_sha256":"872f7709cdc4cd9a0c3c7fa893760de7dc16d4a321961e07cf3def4ec0b69fc9"},"schema_version":"1.0","source":{"id":"1512.09193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09193","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09193v1","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09193","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"pith_short_12","alias_value":"SHYDICVCDORK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SHYDICVCDORKAJIM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SHYDICVC","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:88cbcda208bc544c3de065fa15a1a0b0f3780b8f195dfd020fa5be98bd48e781","target":"graph","created_at":"2026-05-18T01:23:33Z","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":"In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic graph, it belongs to the NP class of computational complexity. A typical example rich in applications is that of connectivity loss in evacuation models for natural hazards management (e.g. coastal floods, hurricanes). Algorithmically, this model reduces to solving a min-cut (or max-flow) problem, with is known to be intractable. The current work covers seve","authors_text":"Iuliana Teodorescu, Pranav Warman, Razvan Teodorescu","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T01:27:54Z","title":"Efficient algorithms for topological inference on random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09193","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:7917601daf9a706d400e601e56d303151e610734abd573d9e3e1f4627a6e23b5","target":"record","created_at":"2026-05-18T01:23:33Z","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":"6b91d8c6ca550ce0e0b96290e950fc80c694e0c12ac74df4ccaae21f48b6a2ff","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-31T01:27:54Z","title_canon_sha256":"872f7709cdc4cd9a0c3c7fa893760de7dc16d4a321961e07cf3def4ec0b69fc9"},"schema_version":"1.0","source":{"id":"1512.09193","kind":"arxiv","version":1}},"canonical_sha256":"91f0340aa21ba2a0250ca5764127ce950d1585543f5c9bf8e4939adf52a9ca87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91f0340aa21ba2a0250ca5764127ce950d1585543f5c9bf8e4939adf52a9ca87","first_computed_at":"2026-05-18T01:23:33.056623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:33.056623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2g+aO1VW8qc3n3xVu5A1FRnGD5czK0mBaunJJtxes+0Cnkhv54QG5+VxLrFOR/E7bxlnjaQ3lSnHvP+CjRZTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:33.057385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.09193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7917601daf9a706d400e601e56d303151e610734abd573d9e3e1f4627a6e23b5","sha256:88cbcda208bc544c3de065fa15a1a0b0f3780b8f195dfd020fa5be98bd48e781"],"state_sha256":"55e29d8fc5a105cda832350582dbe9d6db33db87e97579b4b4b71f44be499556"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mIRgaHuNn8NRl3vHyGgcFA18wzYg9tCKNagT8uxUOs0FTwg07Lkga8rlC+OMW2bwc6JD2cLfsBNrZFy/Yrq/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:38:56.195718Z","bundle_sha256":"0abadc494f27528151f79dfdba13a52a0540b0eb58077fa37768fd676d11bd68"}}