{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MO6DOIEKSHSPMHUPMOVHJWFERC","short_pith_number":"pith:MO6DOIEK","canonical_record":{"source":{"id":"2607.17118","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-07-19T08:09:08Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"1faadb42b081101957131fc422a77f9177a6233d9e89245c93a6f1069d04ff5b","abstract_canon_sha256":"441f8bf4e904a5afda47b36e9f5053280adfa2dd66baa921a6c094dd6004cd20"},"schema_version":"1.0"},"canonical_sha256":"63bc37208a91e4f61e8f63aa74d8a488980d562666e170e8144d6f47f6257b6a","source":{"kind":"arxiv","id":"2607.17118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17118","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17118v1","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17118","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"MO6DOIEKSHSP","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"pith_short_16","alias_value":"MO6DOIEKSHSPMHUP","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"pith_short_8","alias_value":"MO6DOIEK","created_at":"2026-07-21T01:21:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MO6DOIEKSHSPMHUPMOVHJWFERC","target":"record","payload":{"canonical_record":{"source":{"id":"2607.17118","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-07-19T08:09:08Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"1faadb42b081101957131fc422a77f9177a6233d9e89245c93a6f1069d04ff5b","abstract_canon_sha256":"441f8bf4e904a5afda47b36e9f5053280adfa2dd66baa921a6c094dd6004cd20"},"schema_version":"1.0"},"canonical_sha256":"63bc37208a91e4f61e8f63aa74d8a488980d562666e170e8144d6f47f6257b6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:16.597149Z","signature_b64":"xTg2jTCp/Zi1lQ5R77HBsQdORjyJb9r/vY8aK9yChpIMQdzRkVeRFPS5MkZArCRN3LRM1E7nroZagIq7da5sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63bc37208a91e4f61e8f63aa74d8a488980d562666e170e8144d6f47f6257b6a","last_reissued_at":"2026-07-21T01:21:16.596230Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:16.596230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.17118","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-21T01:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/cVe/nf6mLX6v77r3fZRkjz3DXKx2TkGaohnlfYaNAtgS42p6oVANcwOe0ttKjKDAdWQYF04jYE6t51W+p6cAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:38:23.636331Z"},"content_sha256":"fb422f8e61ebaca637c19ffb1178ccdf922db1a38e1fbd28292a69ce66765851","schema_version":"1.0","event_id":"sha256:fb422f8e61ebaca637c19ffb1178ccdf922db1a38e1fbd28292a69ce66765851"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MO6DOIEKSHSPMHUPMOVHJWFERC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fundamental Limits of Query-Based Subgraph Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Wasim Huleihel","submitted_at":"2026-07-19T08:09:08Z","abstract_excerpt":"The planted subgraph detection problem asks whether a random graph contains a hidden structured subgraph. In the classical formulation, the entire adjacency matrix is observed and one distinguishes between an Erd\\H{o}s--R\\'enyi random graph and one obtained by planting a copy of a prescribed graph inside an Erd\\H{o}s--R\\'enyi random graph. The statistical and computational limits of this problem under full observation are now well understood, even for arbitrary planted subgraphs.\n  In this paper, we investigate an information-limited version of the problem in which the planted structure is an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17118","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/2607.17118/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-21T01:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3k1HixnyJLiSIfg7v1ST7zrQlLE8YAecUnQuo8EOr/sF+QstkmebEfmJWjXWr//YUW+9JHuzpX/sQK7V61WDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:38:23.637289Z"},"content_sha256":"feca0e0fb1b9d3d3e40a8470700cd4af73c0f1907821e9b569239b26d632ceeb","schema_version":"1.0","event_id":"sha256:feca0e0fb1b9d3d3e40a8470700cd4af73c0f1907821e9b569239b26d632ceeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MO6DOIEKSHSPMHUPMOVHJWFERC/bundle.json","state_url":"https://pith.science/pith/MO6DOIEKSHSPMHUPMOVHJWFERC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MO6DOIEKSHSPMHUPMOVHJWFERC/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-04T12:38:23Z","links":{"resolver":"https://pith.science/pith/MO6DOIEKSHSPMHUPMOVHJWFERC","bundle":"https://pith.science/pith/MO6DOIEKSHSPMHUPMOVHJWFERC/bundle.json","state":"https://pith.science/pith/MO6DOIEKSHSPMHUPMOVHJWFERC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MO6DOIEKSHSPMHUPMOVHJWFERC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MO6DOIEKSHSPMHUPMOVHJWFERC","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":"441f8bf4e904a5afda47b36e9f5053280adfa2dd66baa921a6c094dd6004cd20","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-07-19T08:09:08Z","title_canon_sha256":"1faadb42b081101957131fc422a77f9177a6233d9e89245c93a6f1069d04ff5b"},"schema_version":"1.0","source":{"id":"2607.17118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17118","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17118v1","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17118","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"MO6DOIEKSHSP","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"pith_short_16","alias_value":"MO6DOIEKSHSPMHUP","created_at":"2026-07-21T01:21:16Z"},{"alias_kind":"pith_short_8","alias_value":"MO6DOIEK","created_at":"2026-07-21T01:21:16Z"}],"graph_snapshots":[{"event_id":"sha256:feca0e0fb1b9d3d3e40a8470700cd4af73c0f1907821e9b569239b26d632ceeb","target":"graph","created_at":"2026-07-21T01:21:16Z","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/2607.17118/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The planted subgraph detection problem asks whether a random graph contains a hidden structured subgraph. In the classical formulation, the entire adjacency matrix is observed and one distinguishes between an Erd\\H{o}s--R\\'enyi random graph and one obtained by planting a copy of a prescribed graph inside an Erd\\H{o}s--R\\'enyi random graph. The statistical and computational limits of this problem under full observation are now well understood, even for arbitrary planted subgraphs.\n  In this paper, we investigate an information-limited version of the problem in which the planted structure is an ","authors_text":"Wasim Huleihel","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17118","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:fb422f8e61ebaca637c19ffb1178ccdf922db1a38e1fbd28292a69ce66765851","target":"record","created_at":"2026-07-21T01:21:16Z","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":"441f8bf4e904a5afda47b36e9f5053280adfa2dd66baa921a6c094dd6004cd20","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-07-19T08:09:08Z","title_canon_sha256":"1faadb42b081101957131fc422a77f9177a6233d9e89245c93a6f1069d04ff5b"},"schema_version":"1.0","source":{"id":"2607.17118","kind":"arxiv","version":1}},"canonical_sha256":"63bc37208a91e4f61e8f63aa74d8a488980d562666e170e8144d6f47f6257b6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63bc37208a91e4f61e8f63aa74d8a488980d562666e170e8144d6f47f6257b6a","first_computed_at":"2026-07-21T01:21:16.596230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:21:16.596230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xTg2jTCp/Zi1lQ5R77HBsQdORjyJb9r/vY8aK9yChpIMQdzRkVeRFPS5MkZArCRN3LRM1E7nroZagIq7da5sCQ==","signature_status":"signed_v1","signed_at":"2026-07-21T01:21:16.597149Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.17118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb422f8e61ebaca637c19ffb1178ccdf922db1a38e1fbd28292a69ce66765851","sha256:feca0e0fb1b9d3d3e40a8470700cd4af73c0f1907821e9b569239b26d632ceeb"],"state_sha256":"ee5952820129d684333fe6d3c38b2dfaf5ba2c5aa77dd267f2ee68cf5245c2e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cD9DQHENUWhNu6M3vCZpVIwszA/8aF0imT2C66rdQ8wQaE+e8cB/sYLeRXFod5YMtXgRzZM94TEDDPuu6HVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:38:23.664374Z","bundle_sha256":"32e3fe150ae7bcf4dc2fed7adc628a9baee664ec66685151f0f91fcc0688199f"}}