{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AFMRKY4RZTD3DRQQ3F4DGUYZIM","short_pith_number":"pith:AFMRKY4R","canonical_record":{"source":{"id":"2404.17012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-25T20:13:19Z","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"title_canon_sha256":"67cd7a7147c0a4bc74092b76927a749a4e043b1e52aa2dbab24fa2305445ff62","abstract_canon_sha256":"1943b782aeb4743f55f58bed59deb69acbef966fbfb2231a9690ae6bc6c60b83"},"schema_version":"1.0"},"canonical_sha256":"0159156391ccc7b1c610d9783353194314c3715aa9d050f9574230aa44aac81d","source":{"kind":"arxiv","id":"2404.17012","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.17012","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"2404.17012v1","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.17012","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"AFMRKY4RZTD3","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"pith_short_16","alias_value":"AFMRKY4RZTD3DRQQ","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"pith_short_8","alias_value":"AFMRKY4R","created_at":"2026-07-05T08:12:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AFMRKY4RZTD3DRQQ3F4DGUYZIM","target":"record","payload":{"canonical_record":{"source":{"id":"2404.17012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-25T20:13:19Z","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"title_canon_sha256":"67cd7a7147c0a4bc74092b76927a749a4e043b1e52aa2dbab24fa2305445ff62","abstract_canon_sha256":"1943b782aeb4743f55f58bed59deb69acbef966fbfb2231a9690ae6bc6c60b83"},"schema_version":"1.0"},"canonical_sha256":"0159156391ccc7b1c610d9783353194314c3715aa9d050f9574230aa44aac81d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:18.365696Z","signature_b64":"5Op7/2e46+odTYDFKGWsd9d/8U9A3dFjrIN+4C1dMK9u1UlP3VlypsTRmaOGH9eNKDhYXwlYk8y8pWDmebSWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0159156391ccc7b1c610d9783353194314c3715aa9d050f9574230aa44aac81d","last_reissued_at":"2026-07-05T08:12:18.365211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:18.365211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.17012","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-05T08:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5muPVmpDqGplPyWq02oSI2+QVjBjxPkEkGUYlRzZQZz50gDhBJ2345ig5ldUM+FuPApQhZADY04dig6PDFCeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:14:19.021836Z"},"content_sha256":"7e37747c16d0f89fc8a3eed716a1e1b3b9a52ad4710b0b5f5967635cd9ae0209","schema_version":"1.0","event_id":"sha256:7e37747c16d0f89fc8a3eed716a1e1b3b9a52ad4710b0b5f5967635cd9ae0209"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AFMRKY4RZTD3DRQQ3F4DGUYZIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Dmitriy Kunisky, Xifan Yu","submitted_at":"2024-04-25T20:13:19Z","abstract_excerpt":"We introduce a new conjecture on the computational hardness of detecting random lifts of graphs: we claim that there is no polynomial-time algorithm that can distinguish between a large random $d$-regular graph and a large random lift of a Ramanujan $d$-regular base graph (provided that the lift is corrupted by a small amount of extra noise), and likewise for bipartite random graphs and lifts of bipartite Ramanujan graphs. We give evidence for this conjecture by proving lower bounds against the local statistics hierarchy of hypothesis testing semidefinite programs. We then explore the conseque"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.17012","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/2404.17012/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-05T08:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYdPs35+nEWVOemGjBKV+GmQJ+Y0osjQjlVfhTyruRh/F7u7tBBuXgv/EXctY4qW/rT+/RydTPjXEzn25rHlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:14:19.050977Z"},"content_sha256":"28015de122914acc523cb555843c3e25d2ee73b0eec489f8e2bf728e170327da","schema_version":"1.0","event_id":"sha256:28015de122914acc523cb555843c3e25d2ee73b0eec489f8e2bf728e170327da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFMRKY4RZTD3DRQQ3F4DGUYZIM/bundle.json","state_url":"https://pith.science/pith/AFMRKY4RZTD3DRQQ3F4DGUYZIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFMRKY4RZTD3DRQQ3F4DGUYZIM/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-21T13:14:19Z","links":{"resolver":"https://pith.science/pith/AFMRKY4RZTD3DRQQ3F4DGUYZIM","bundle":"https://pith.science/pith/AFMRKY4RZTD3DRQQ3F4DGUYZIM/bundle.json","state":"https://pith.science/pith/AFMRKY4RZTD3DRQQ3F4DGUYZIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFMRKY4RZTD3DRQQ3F4DGUYZIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AFMRKY4RZTD3DRQQ3F4DGUYZIM","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":"1943b782aeb4743f55f58bed59deb69acbef966fbfb2231a9690ae6bc6c60b83","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-25T20:13:19Z","title_canon_sha256":"67cd7a7147c0a4bc74092b76927a749a4e043b1e52aa2dbab24fa2305445ff62"},"schema_version":"1.0","source":{"id":"2404.17012","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.17012","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"2404.17012v1","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.17012","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"AFMRKY4RZTD3","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"pith_short_16","alias_value":"AFMRKY4RZTD3DRQQ","created_at":"2026-07-05T08:12:18Z"},{"alias_kind":"pith_short_8","alias_value":"AFMRKY4R","created_at":"2026-07-05T08:12:18Z"}],"graph_snapshots":[{"event_id":"sha256:28015de122914acc523cb555843c3e25d2ee73b0eec489f8e2bf728e170327da","target":"graph","created_at":"2026-07-05T08:12:18Z","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/2404.17012/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new conjecture on the computational hardness of detecting random lifts of graphs: we claim that there is no polynomial-time algorithm that can distinguish between a large random $d$-regular graph and a large random lift of a Ramanujan $d$-regular base graph (provided that the lift is corrupted by a small amount of extra noise), and likewise for bipartite random graphs and lifts of bipartite Ramanujan graphs. We give evidence for this conjecture by proving lower bounds against the local statistics hierarchy of hypothesis testing semidefinite programs. We then explore the conseque","authors_text":"Dmitriy Kunisky, Xifan Yu","cross_cats":["cs.DS","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-25T20:13:19Z","title":"Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.17012","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:7e37747c16d0f89fc8a3eed716a1e1b3b9a52ad4710b0b5f5967635cd9ae0209","target":"record","created_at":"2026-07-05T08:12:18Z","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":"1943b782aeb4743f55f58bed59deb69acbef966fbfb2231a9690ae6bc6c60b83","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-25T20:13:19Z","title_canon_sha256":"67cd7a7147c0a4bc74092b76927a749a4e043b1e52aa2dbab24fa2305445ff62"},"schema_version":"1.0","source":{"id":"2404.17012","kind":"arxiv","version":1}},"canonical_sha256":"0159156391ccc7b1c610d9783353194314c3715aa9d050f9574230aa44aac81d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0159156391ccc7b1c610d9783353194314c3715aa9d050f9574230aa44aac81d","first_computed_at":"2026-07-05T08:12:18.365211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:12:18.365211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Op7/2e46+odTYDFKGWsd9d/8U9A3dFjrIN+4C1dMK9u1UlP3VlypsTRmaOGH9eNKDhYXwlYk8y8pWDmebSWAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:12:18.365696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.17012","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e37747c16d0f89fc8a3eed716a1e1b3b9a52ad4710b0b5f5967635cd9ae0209","sha256:28015de122914acc523cb555843c3e25d2ee73b0eec489f8e2bf728e170327da"],"state_sha256":"b180f041ee95a138bdca8ddec510f718fa91d3a8cdc481ab2a6d1d709cc4d142"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5D/3bXq7SqCZqfm7GMMdgUKQHQDvhFo2f8tpmKeRtrzcaS3aC9oD4W9X2UwQ1Efv6KqEo9Tb0tqCqDgkFMsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T13:14:19.056025Z","bundle_sha256":"7719e3b96c14f4e301542525f5c4bc76fc795419db87735787cbf8f48bdfe1c0"}}