{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SCW3C4P2WRSU4GSHHLHYWBGQXY","short_pith_number":"pith:SCW3C4P2","canonical_record":{"source":{"id":"1711.06920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T19:14:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8b8f7d6565eb4c3baead1137c4c81dd50ed40e7f7709da24c1aa15dfdd693bc8","abstract_canon_sha256":"855aa1e92d081436b65d429b1beca8c717dc56b54fb2dd418e1454fbd97c4d6a"},"schema_version":"1.0"},"canonical_sha256":"90adb171fab4654e1a473acf8b04d0be168d5c34329e6d1f5771848f97941e84","source":{"kind":"arxiv","id":"1711.06920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06920","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06920v1","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06920","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"SCW3C4P2WRSU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SCW3C4P2WRSU4GSH","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SCW3C4P2","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SCW3C4P2WRSU4GSHHLHYWBGQXY","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T19:14:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8b8f7d6565eb4c3baead1137c4c81dd50ed40e7f7709da24c1aa15dfdd693bc8","abstract_canon_sha256":"855aa1e92d081436b65d429b1beca8c717dc56b54fb2dd418e1454fbd97c4d6a"},"schema_version":"1.0"},"canonical_sha256":"90adb171fab4654e1a473acf8b04d0be168d5c34329e6d1f5771848f97941e84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:15.187796Z","signature_b64":"9F6qyp/8rvuHdOWipMBXdOsy9sL/9u00RQ7slH2WuOZsHb6IPq5w5FOpwzUsUa2n9hpBg9tKfIZkFM7GB0zmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90adb171fab4654e1a473acf8b04d0be168d5c34329e6d1f5771848f97941e84","last_reissued_at":"2026-05-18T00:30:15.187057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:15.187057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06920","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-05-18T00:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXiyJzg5kf6M5Za9GoW+h+Dk0Mq0scgmkKve41zcTxsPC+W3AE/DU8TUF6rPlXrAwPVOaHhl8Uo7saDz1cKKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:02:27.148244Z"},"content_sha256":"b77f1d4e91faa3613dd9fee2beac2a8b2eff223d91e0e8cd711575ec2b015dba","schema_version":"1.0","event_id":"sha256:b77f1d4e91faa3613dd9fee2beac2a8b2eff223d91e0e8cd711575ec2b015dba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SCW3C4P2WRSU4GSHHLHYWBGQXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superlinear Lower Bounds for Distributed Subgraph Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Orr Fischer, Rotem Oshman, Tzlil Gonen","submitted_at":"2017-11-18T19:14:28Z","abstract_excerpt":"In the distributed subgraph-freeness problem, we are given a graph $H$, and asked to determine whether the network graph contains $H$ as a subgraph or not. Subgraph-freeness is an extremely local problem: if the network had no bandwidth constraints, we could detect any subgraph $H$ in $|H|$ rounds, by having each node of the network learn its entire $|H|$-neighborhood. However, when bandwidth is limited, the problem becomes harder.\n  Upper and lower bounds in the presence of congestion have been established for several classes of subgraphs, including cycles, trees, and more complicated subgrap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06920","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":""},"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-18T00:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qtQnATeI358btbKeaQANFhyq2MdKstyBxcgidMtQqTmLZLTzlztqULtny965if3wrUVrPjjDymG9Cb+xeEmGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:02:27.148652Z"},"content_sha256":"bb2094276a3aa210785bcc25695f42c133b8e2fc97f22d2392437c1af5890651","schema_version":"1.0","event_id":"sha256:bb2094276a3aa210785bcc25695f42c133b8e2fc97f22d2392437c1af5890651"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/bundle.json","state_url":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/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-05-31T01:02:27Z","links":{"resolver":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY","bundle":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/bundle.json","state":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SCW3C4P2WRSU4GSHHLHYWBGQXY","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":"855aa1e92d081436b65d429b1beca8c717dc56b54fb2dd418e1454fbd97c4d6a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T19:14:28Z","title_canon_sha256":"8b8f7d6565eb4c3baead1137c4c81dd50ed40e7f7709da24c1aa15dfdd693bc8"},"schema_version":"1.0","source":{"id":"1711.06920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06920","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06920v1","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06920","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"SCW3C4P2WRSU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SCW3C4P2WRSU4GSH","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SCW3C4P2","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:bb2094276a3aa210785bcc25695f42c133b8e2fc97f22d2392437c1af5890651","target":"graph","created_at":"2026-05-18T00:30:15Z","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":"In the distributed subgraph-freeness problem, we are given a graph $H$, and asked to determine whether the network graph contains $H$ as a subgraph or not. Subgraph-freeness is an extremely local problem: if the network had no bandwidth constraints, we could detect any subgraph $H$ in $|H|$ rounds, by having each node of the network learn its entire $|H|$-neighborhood. However, when bandwidth is limited, the problem becomes harder.\n  Upper and lower bounds in the presence of congestion have been established for several classes of subgraphs, including cycles, trees, and more complicated subgrap","authors_text":"Orr Fischer, Rotem Oshman, Tzlil Gonen","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T19:14:28Z","title":"Superlinear Lower Bounds for Distributed Subgraph Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06920","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:b77f1d4e91faa3613dd9fee2beac2a8b2eff223d91e0e8cd711575ec2b015dba","target":"record","created_at":"2026-05-18T00:30:15Z","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":"855aa1e92d081436b65d429b1beca8c717dc56b54fb2dd418e1454fbd97c4d6a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T19:14:28Z","title_canon_sha256":"8b8f7d6565eb4c3baead1137c4c81dd50ed40e7f7709da24c1aa15dfdd693bc8"},"schema_version":"1.0","source":{"id":"1711.06920","kind":"arxiv","version":1}},"canonical_sha256":"90adb171fab4654e1a473acf8b04d0be168d5c34329e6d1f5771848f97941e84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90adb171fab4654e1a473acf8b04d0be168d5c34329e6d1f5771848f97941e84","first_computed_at":"2026-05-18T00:30:15.187057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:15.187057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9F6qyp/8rvuHdOWipMBXdOsy9sL/9u00RQ7slH2WuOZsHb6IPq5w5FOpwzUsUa2n9hpBg9tKfIZkFM7GB0zmBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:15.187796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b77f1d4e91faa3613dd9fee2beac2a8b2eff223d91e0e8cd711575ec2b015dba","sha256:bb2094276a3aa210785bcc25695f42c133b8e2fc97f22d2392437c1af5890651"],"state_sha256":"7fa14d77cf12111b0409278097190d671ecccff9fbec8a59d73bc39da7c839fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQiMUAczyupjdktZcnE7sp1/3moY8xoegxkU5i7QstYaTfXVRIpv1WUtdQAUNJ/22QX2lp2m6pFAlel/RCaLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:02:27.151827Z","bundle_sha256":"88557e590087343d639b64f937dd23961550abaa43e093a74e474cf97125ebd4"}}