{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ULDQVWZHPCYQTLX4ZN6KXNJD3M","short_pith_number":"pith:ULDQVWZH","canonical_record":{"source":{"id":"2403.17766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-03-26T14:54:02Z","cross_cats_sorted":["cs.CC","cs.DS","stat.TH"],"title_canon_sha256":"c55ba242f68ad7eabb3dba2048529057b7cb6b22f063f6c20f28aa3497380453","abstract_canon_sha256":"9c6c2466086047cc863ab5fed79a17337a1736ad474e52f3cdfce27813f817b9"},"schema_version":"1.0"},"canonical_sha256":"a2c70adb2778b109aefccb7cabb523db00c90fc4656878902d83a2d6949d090b","source":{"kind":"arxiv","id":"2403.17766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.17766","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"arxiv_version","alias_value":"2403.17766v1","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.17766","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"pith_short_12","alias_value":"ULDQVWZHPCYQ","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"pith_short_16","alias_value":"ULDQVWZHPCYQTLX4","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"pith_short_8","alias_value":"ULDQVWZH","created_at":"2026-07-05T08:00:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ULDQVWZHPCYQTLX4ZN6KXNJD3M","target":"record","payload":{"canonical_record":{"source":{"id":"2403.17766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-03-26T14:54:02Z","cross_cats_sorted":["cs.CC","cs.DS","stat.TH"],"title_canon_sha256":"c55ba242f68ad7eabb3dba2048529057b7cb6b22f063f6c20f28aa3497380453","abstract_canon_sha256":"9c6c2466086047cc863ab5fed79a17337a1736ad474e52f3cdfce27813f817b9"},"schema_version":"1.0"},"canonical_sha256":"a2c70adb2778b109aefccb7cabb523db00c90fc4656878902d83a2d6949d090b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:55.103673Z","signature_b64":"ypjni3Me4NB+IJq/9/ILqmWKSdGB+N3D3WQmelBgIPz2z9BNZhCQBFqll9dEKGZyR+exjK+0O0oIxsI24QF+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2c70adb2778b109aefccb7cabb523db00c90fc4656878902d83a2d6949d090b","last_reissued_at":"2026-07-05T08:00:55.103178Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:55.103178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.17766","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:00:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFLCddN/mLPaI/Cj4A3PH9GOn9HgMd2lHQ7bzZElNH0XTNUOkZvQ/We6TEN3BBAT3d/td154b7uVu0IcSSGpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:41:17.803708Z"},"content_sha256":"6caf78bde6cde42d860b2a321129736d95b3a2c85dd292f00b8a90cf56a70956","schema_version":"1.0","event_id":"sha256:6caf78bde6cde42d860b2a321129736d95b3a2c85dd292f00b8a90cf56a70956"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ULDQVWZHPCYQTLX4ZN6KXNJD3M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","stat.TH"],"primary_cat":"math.ST","authors_text":"Ilias Zadik, Peiyuan Zhang, Xifan Yu","submitted_at":"2024-03-26T14:54:02Z","abstract_excerpt":"We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \\emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erd\\H{o}s-R\\'{e}nyi random graph G(n,p) and a ``planted'' random graph which is the union of G(n,p) together with a random copy of H=H_n. Our notion of planted model is a generalization of a plethora of recently studied models initiated with the study of the planted clique model (Jerrum 1992), which corresponds to the special case where H is a k-clique and p=1/2.\n  Over the last decade, several pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.17766","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/2403.17766/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:00:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkOlz+fTVGZMQJb9jL1XfwvyTJyNTaNY9kAs/a31HKtOfHfVrJ2EwyQXQvQZq+N9Fbe5W5FcqjIZ/Ee0ewcbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:41:17.804092Z"},"content_sha256":"65df347c59e5a09b2af87c877f4a8fe5f1239e5a01d96c97a5ad5a92a3eb74aa","schema_version":"1.0","event_id":"sha256:65df347c59e5a09b2af87c877f4a8fe5f1239e5a01d96c97a5ad5a92a3eb74aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULDQVWZHPCYQTLX4ZN6KXNJD3M/bundle.json","state_url":"https://pith.science/pith/ULDQVWZHPCYQTLX4ZN6KXNJD3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULDQVWZHPCYQTLX4ZN6KXNJD3M/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-07-07T11:41:17Z","links":{"resolver":"https://pith.science/pith/ULDQVWZHPCYQTLX4ZN6KXNJD3M","bundle":"https://pith.science/pith/ULDQVWZHPCYQTLX4ZN6KXNJD3M/bundle.json","state":"https://pith.science/pith/ULDQVWZHPCYQTLX4ZN6KXNJD3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULDQVWZHPCYQTLX4ZN6KXNJD3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ULDQVWZHPCYQTLX4ZN6KXNJD3M","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":"9c6c2466086047cc863ab5fed79a17337a1736ad474e52f3cdfce27813f817b9","cross_cats_sorted":["cs.CC","cs.DS","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-03-26T14:54:02Z","title_canon_sha256":"c55ba242f68ad7eabb3dba2048529057b7cb6b22f063f6c20f28aa3497380453"},"schema_version":"1.0","source":{"id":"2403.17766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.17766","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"arxiv_version","alias_value":"2403.17766v1","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.17766","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"pith_short_12","alias_value":"ULDQVWZHPCYQ","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"pith_short_16","alias_value":"ULDQVWZHPCYQTLX4","created_at":"2026-07-05T08:00:55Z"},{"alias_kind":"pith_short_8","alias_value":"ULDQVWZH","created_at":"2026-07-05T08:00:55Z"}],"graph_snapshots":[{"event_id":"sha256:65df347c59e5a09b2af87c877f4a8fe5f1239e5a01d96c97a5ad5a92a3eb74aa","target":"graph","created_at":"2026-07-05T08:00:55Z","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/2403.17766/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \\emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erd\\H{o}s-R\\'{e}nyi random graph G(n,p) and a ``planted'' random graph which is the union of G(n,p) together with a random copy of H=H_n. Our notion of planted model is a generalization of a plethora of recently studied models initiated with the study of the planted clique model (Jerrum 1992), which corresponds to the special case where H is a k-clique and p=1/2.\n  Over the last decade, several pap","authors_text":"Ilias Zadik, Peiyuan Zhang, Xifan Yu","cross_cats":["cs.CC","cs.DS","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-03-26T14:54:02Z","title":"Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.17766","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:6caf78bde6cde42d860b2a321129736d95b3a2c85dd292f00b8a90cf56a70956","target":"record","created_at":"2026-07-05T08:00:55Z","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":"9c6c2466086047cc863ab5fed79a17337a1736ad474e52f3cdfce27813f817b9","cross_cats_sorted":["cs.CC","cs.DS","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-03-26T14:54:02Z","title_canon_sha256":"c55ba242f68ad7eabb3dba2048529057b7cb6b22f063f6c20f28aa3497380453"},"schema_version":"1.0","source":{"id":"2403.17766","kind":"arxiv","version":1}},"canonical_sha256":"a2c70adb2778b109aefccb7cabb523db00c90fc4656878902d83a2d6949d090b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2c70adb2778b109aefccb7cabb523db00c90fc4656878902d83a2d6949d090b","first_computed_at":"2026-07-05T08:00:55.103178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:00:55.103178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ypjni3Me4NB+IJq/9/ILqmWKSdGB+N3D3WQmelBgIPz2z9BNZhCQBFqll9dEKGZyR+exjK+0O0oIxsI24QF+DA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:00:55.103673Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.17766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6caf78bde6cde42d860b2a321129736d95b3a2c85dd292f00b8a90cf56a70956","sha256:65df347c59e5a09b2af87c877f4a8fe5f1239e5a01d96c97a5ad5a92a3eb74aa"],"state_sha256":"c56fc67b2a47cce8ab32975427f12c7e91539f02b35c49f43d3aaa5f902616aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tmy9x+UcYfuZ8QVJ2R9f9xNA/vJ+Y6VubGcFuBhhxOIRs0ukxyBtlajnkGC97RDcYKKb/1+1tvGtLsTOL35qAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:41:17.806086Z","bundle_sha256":"5569abffa32c5fe2de4b46be39fd2c6622a33fdb31c2a0e3776333c0d54786fa"}}