{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EMKX7T3OIYYBDFFA3IHAFQ3TO6","short_pith_number":"pith:EMKX7T3O","canonical_record":{"source":{"id":"2404.03472","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-04T14:25:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"44647d2241de29ade654c21e01076f6251395d57f6749568c0bd6cc4232bf49a","abstract_canon_sha256":"12f375260fe378604cb770d74d6fdb35bbfdd6eed77d47ea7741fce7d4301222"},"schema_version":"1.0"},"canonical_sha256":"23157fcf6e46301194a0da0e02c3737790ef825d01207913b8abefcafcdf094e","source":{"kind":"arxiv","id":"2404.03472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.03472","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2404.03472v1","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03472","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"EMKX7T3OIYYB","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"EMKX7T3OIYYBDFFA","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"EMKX7T3O","created_at":"2026-07-05T08:04:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EMKX7T3OIYYBDFFA3IHAFQ3TO6","target":"record","payload":{"canonical_record":{"source":{"id":"2404.03472","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-04T14:25:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"44647d2241de29ade654c21e01076f6251395d57f6749568c0bd6cc4232bf49a","abstract_canon_sha256":"12f375260fe378604cb770d74d6fdb35bbfdd6eed77d47ea7741fce7d4301222"},"schema_version":"1.0"},"canonical_sha256":"23157fcf6e46301194a0da0e02c3737790ef825d01207913b8abefcafcdf094e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:26.304873Z","signature_b64":"7e1LlU3F96xZykE2x6PRDvK4TOjqiUoJMOmKxbPozvoLWHOC/E1eeW4GDOYbqIffS2kSXQOUmc1bXSvM8ymIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23157fcf6e46301194a0da0e02c3737790ef825d01207913b8abefcafcdf094e","last_reissued_at":"2026-07-05T08:04:26.304455Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:26.304455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.03472","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:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kFZs716Wyhn0HKdu/1YJPw6nZz2r1KBRY5iYEI70jfDGMKZ5ad1qccQPOTZDm1ICsKUXBNPrX8+MbLTWAl6DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:54:35.146885Z"},"content_sha256":"079857d63c265968fdf41e01b040e0cc75758b1e90a39ad8dbecc98afcf81e6e","schema_version":"1.0","event_id":"sha256:079857d63c265968fdf41e01b040e0cc75758b1e90a39ad8dbecc98afcf81e6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EMKX7T3OIYYBDFFA3IHAFQ3TO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds for graph reconstruction with maximal independent set queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Alex Scott, Lukas Michel","submitted_at":"2024-04-04T14:25:21Z","abstract_excerpt":"We investigate the number of maximal independent set queries required to reconstruct the edges of a hidden graph. We show that randomised adaptive algorithms need at least $\\Omega(\\Delta^2 \\log(n / \\Delta) / \\log \\Delta)$ queries to reconstruct $n$-vertex graphs of maximum degree $\\Delta$ with success probability at least $1/2$, and we further improve this lower bound to $\\Omega(\\Delta^2 \\log(n / \\Delta))$ for randomised non-adaptive algorithms. We also prove that deterministic non-adaptive algorithms require at least $\\Omega(\\Delta^3 \\log n / \\log \\Delta)$ queries.\n  This improves bounds of K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03472","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.03472/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:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TcRTuoaXJYtH2g64STtJlS8u49YCwECOIo1QyEPovE21OAyJnTcD91B4vDreQQH0zkX5WqloK2KGSOOVuL9nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:54:35.147259Z"},"content_sha256":"037182e024fe6ebb76f149d85a6cba0d3059a5ad2756ae7f0797d4b695057ba5","schema_version":"1.0","event_id":"sha256:037182e024fe6ebb76f149d85a6cba0d3059a5ad2756ae7f0797d4b695057ba5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMKX7T3OIYYBDFFA3IHAFQ3TO6/bundle.json","state_url":"https://pith.science/pith/EMKX7T3OIYYBDFFA3IHAFQ3TO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMKX7T3OIYYBDFFA3IHAFQ3TO6/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-06T13:54:35Z","links":{"resolver":"https://pith.science/pith/EMKX7T3OIYYBDFFA3IHAFQ3TO6","bundle":"https://pith.science/pith/EMKX7T3OIYYBDFFA3IHAFQ3TO6/bundle.json","state":"https://pith.science/pith/EMKX7T3OIYYBDFFA3IHAFQ3TO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMKX7T3OIYYBDFFA3IHAFQ3TO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EMKX7T3OIYYBDFFA3IHAFQ3TO6","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":"12f375260fe378604cb770d74d6fdb35bbfdd6eed77d47ea7741fce7d4301222","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-04T14:25:21Z","title_canon_sha256":"44647d2241de29ade654c21e01076f6251395d57f6749568c0bd6cc4232bf49a"},"schema_version":"1.0","source":{"id":"2404.03472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.03472","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2404.03472v1","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03472","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"EMKX7T3OIYYB","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"EMKX7T3OIYYBDFFA","created_at":"2026-07-05T08:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"EMKX7T3O","created_at":"2026-07-05T08:04:26Z"}],"graph_snapshots":[{"event_id":"sha256:037182e024fe6ebb76f149d85a6cba0d3059a5ad2756ae7f0797d4b695057ba5","target":"graph","created_at":"2026-07-05T08:04:26Z","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.03472/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the number of maximal independent set queries required to reconstruct the edges of a hidden graph. We show that randomised adaptive algorithms need at least $\\Omega(\\Delta^2 \\log(n / \\Delta) / \\log \\Delta)$ queries to reconstruct $n$-vertex graphs of maximum degree $\\Delta$ with success probability at least $1/2$, and we further improve this lower bound to $\\Omega(\\Delta^2 \\log(n / \\Delta))$ for randomised non-adaptive algorithms. We also prove that deterministic non-adaptive algorithms require at least $\\Omega(\\Delta^3 \\log n / \\log \\Delta)$ queries.\n  This improves bounds of K","authors_text":"Alex Scott, Lukas Michel","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-04T14:25:21Z","title":"Lower bounds for graph reconstruction with maximal independent set queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03472","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:079857d63c265968fdf41e01b040e0cc75758b1e90a39ad8dbecc98afcf81e6e","target":"record","created_at":"2026-07-05T08:04:26Z","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":"12f375260fe378604cb770d74d6fdb35bbfdd6eed77d47ea7741fce7d4301222","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-04T14:25:21Z","title_canon_sha256":"44647d2241de29ade654c21e01076f6251395d57f6749568c0bd6cc4232bf49a"},"schema_version":"1.0","source":{"id":"2404.03472","kind":"arxiv","version":1}},"canonical_sha256":"23157fcf6e46301194a0da0e02c3737790ef825d01207913b8abefcafcdf094e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23157fcf6e46301194a0da0e02c3737790ef825d01207913b8abefcafcdf094e","first_computed_at":"2026-07-05T08:04:26.304455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:04:26.304455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7e1LlU3F96xZykE2x6PRDvK4TOjqiUoJMOmKxbPozvoLWHOC/E1eeW4GDOYbqIffS2kSXQOUmc1bXSvM8ymIDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:04:26.304873Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.03472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:079857d63c265968fdf41e01b040e0cc75758b1e90a39ad8dbecc98afcf81e6e","sha256:037182e024fe6ebb76f149d85a6cba0d3059a5ad2756ae7f0797d4b695057ba5"],"state_sha256":"4fd913fd55debc9e6da6794c5e7cc019c7eba01a2bcc0dc9e85a2eb067354d7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9oGVUYIdO+i+27FGDhB7wb7+g5gX29sUFmMkFD8APzKv7wZPIoNXvGRmh//T86GrbxoCiWs+0Xz6R51VbHZHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:54:35.149258Z","bundle_sha256":"ca692b8c57183f1e792f062e1b0b13702ff8acfde8c35e1c20a19273afcd1681"}}