{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4T2HBLQJFBRFA77WSOYODP24MP","short_pith_number":"pith:4T2HBLQJ","canonical_record":{"source":{"id":"1306.0110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T14:12:03Z","cross_cats_sorted":["cs.CC","math.AT"],"title_canon_sha256":"631709d46d0a4f8a5fc297d704dd66585ce71a65b9a2ba9d02702364822fd0bb","abstract_canon_sha256":"8e3b80f9555751a756dce69287b185227ad71c8bb2dce47942c5cd67697467a2"},"schema_version":"1.0"},"canonical_sha256":"e4f470ae092862507ff693b0e1bf5c63cfa649d4452e9cd8f0a84d46a78d3e28","source":{"kind":"arxiv","id":"1306.0110","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0110","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0110v2","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0110","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"4T2HBLQJFBRF","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4T2HBLQJFBRFA77W","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4T2HBLQJ","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4T2HBLQJFBRFA77WSOYODP24MP","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T14:12:03Z","cross_cats_sorted":["cs.CC","math.AT"],"title_canon_sha256":"631709d46d0a4f8a5fc297d704dd66585ce71a65b9a2ba9d02702364822fd0bb","abstract_canon_sha256":"8e3b80f9555751a756dce69287b185227ad71c8bb2dce47942c5cd67697467a2"},"schema_version":"1.0"},"canonical_sha256":"e4f470ae092862507ff693b0e1bf5c63cfa649d4452e9cd8f0a84d46a78d3e28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:23.227496Z","signature_b64":"vM4/wCt3pypxYmniUSZTGcNc1HE9axVdZaJx1ygjH+jr8BdnfFu9Hc4lgUC/xlGMs1Q8oKI0VmFzqyPdFn1LDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4f470ae092862507ff693b0e1bf5c63cfa649d4452e9cd8f0a84d46a78d3e28","last_reissued_at":"2026-05-18T03:21:23.226854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:23.226854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0110","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-18T03:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgFdRXojn+J9IPbw3qQWWr0pv/+PautQEeu1picY4CY/NrlVkS9aSbfmDDSzPczyVVUySU11+aXhZVazmUN7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:17:30.607911Z"},"content_sha256":"ea848f2b91107f1efa54ba54990ef368ab74290f741766fc3e1d577522fb53bb","schema_version":"1.0","event_id":"sha256:ea848f2b91107f1efa54ba54990ef368ab74290f741766fc3e1d577522fb53bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4T2HBLQJFBRFA77WSOYODP24MP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evasiveness of Graph Properties and Topological Fixed-Point Theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.AT"],"primary_cat":"math.CO","authors_text":"Carl A. Miller","submitted_at":"2013-06-01T14:12:03Z","abstract_excerpt":"Many graph properties (e.g., connectedness, containing a complete subgraph) are known to be difficult to check. In a decision-tree model, the cost of an algorithm is measured by the number of edges in the graph that it queries. R. Karp conjectured in the early 1970s that all monotone graph properties are evasive -- that is, any algorithm which computes a monotone graph property must check all edges in the worst case. This conjecture is unproven, but a lot of progress has been made. Starting with the work of Kahn, Saks, and Sturtevant in 1984, topological methods have been applied to prove part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0110","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-18T03:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQxLrrjkRjwwSaLSSqbUfvkfnDj83qYoWIQNtDO7lh5PXh5uM6026PSeecjpfh75jpFvFBRLABqUphPjQplOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T23:17:30.608256Z"},"content_sha256":"c2a16f07c074f7be3bd39eff83e806ca55f12d45b7c15b576e6282a8022df03e","schema_version":"1.0","event_id":"sha256:c2a16f07c074f7be3bd39eff83e806ca55f12d45b7c15b576e6282a8022df03e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4T2HBLQJFBRFA77WSOYODP24MP/bundle.json","state_url":"https://pith.science/pith/4T2HBLQJFBRFA77WSOYODP24MP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4T2HBLQJFBRFA77WSOYODP24MP/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-19T23:17:30Z","links":{"resolver":"https://pith.science/pith/4T2HBLQJFBRFA77WSOYODP24MP","bundle":"https://pith.science/pith/4T2HBLQJFBRFA77WSOYODP24MP/bundle.json","state":"https://pith.science/pith/4T2HBLQJFBRFA77WSOYODP24MP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4T2HBLQJFBRFA77WSOYODP24MP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4T2HBLQJFBRFA77WSOYODP24MP","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":"8e3b80f9555751a756dce69287b185227ad71c8bb2dce47942c5cd67697467a2","cross_cats_sorted":["cs.CC","math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T14:12:03Z","title_canon_sha256":"631709d46d0a4f8a5fc297d704dd66585ce71a65b9a2ba9d02702364822fd0bb"},"schema_version":"1.0","source":{"id":"1306.0110","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0110","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0110v2","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0110","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"4T2HBLQJFBRF","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4T2HBLQJFBRFA77W","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4T2HBLQJ","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:c2a16f07c074f7be3bd39eff83e806ca55f12d45b7c15b576e6282a8022df03e","target":"graph","created_at":"2026-05-18T03:21:23Z","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":"Many graph properties (e.g., connectedness, containing a complete subgraph) are known to be difficult to check. In a decision-tree model, the cost of an algorithm is measured by the number of edges in the graph that it queries. R. Karp conjectured in the early 1970s that all monotone graph properties are evasive -- that is, any algorithm which computes a monotone graph property must check all edges in the worst case. This conjecture is unproven, but a lot of progress has been made. Starting with the work of Kahn, Saks, and Sturtevant in 1984, topological methods have been applied to prove part","authors_text":"Carl A. Miller","cross_cats":["cs.CC","math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T14:12:03Z","title":"Evasiveness of Graph Properties and Topological Fixed-Point Theorems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0110","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:ea848f2b91107f1efa54ba54990ef368ab74290f741766fc3e1d577522fb53bb","target":"record","created_at":"2026-05-18T03:21:23Z","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":"8e3b80f9555751a756dce69287b185227ad71c8bb2dce47942c5cd67697467a2","cross_cats_sorted":["cs.CC","math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T14:12:03Z","title_canon_sha256":"631709d46d0a4f8a5fc297d704dd66585ce71a65b9a2ba9d02702364822fd0bb"},"schema_version":"1.0","source":{"id":"1306.0110","kind":"arxiv","version":2}},"canonical_sha256":"e4f470ae092862507ff693b0e1bf5c63cfa649d4452e9cd8f0a84d46a78d3e28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4f470ae092862507ff693b0e1bf5c63cfa649d4452e9cd8f0a84d46a78d3e28","first_computed_at":"2026-05-18T03:21:23.226854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:23.226854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vM4/wCt3pypxYmniUSZTGcNc1HE9axVdZaJx1ygjH+jr8BdnfFu9Hc4lgUC/xlGMs1Q8oKI0VmFzqyPdFn1LDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:23.227496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0110","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea848f2b91107f1efa54ba54990ef368ab74290f741766fc3e1d577522fb53bb","sha256:c2a16f07c074f7be3bd39eff83e806ca55f12d45b7c15b576e6282a8022df03e"],"state_sha256":"41b0f7cd47ac5890467667ad3f10c6383a449ee5546faa67fc247a591f1307ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8q30P91if01Two8m7Vy5rE/BE+iWDBuB3kODkj4sDBn7r4pbJJPUEERkUoa7G1/JK5Ne6quOIffmRjkLPJ6iCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T23:17:30.610358Z","bundle_sha256":"68c1c7ce5feae7200a9fa95bccece7d076174130bc300bd183df1f24d55456aa"}}