{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EQJ3V7LX2WDQTQIJ5RLE3BF3JZ","short_pith_number":"pith:EQJ3V7LX","canonical_record":{"source":{"id":"1702.03959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-13T19:35:15Z","cross_cats_sorted":[],"title_canon_sha256":"b25073ff1b9f5ed2aff71624d36f30524a6e042cd32edf7428437d9591acba88","abstract_canon_sha256":"471c6cdc258dc0aeb15068ba386365d7ec23f75b8ca566b29b7f6e84b89698f4"},"schema_version":"1.0"},"canonical_sha256":"2413bafd77d58709c109ec564d84bb4e76d7d2ada8de5013312742eca8925d91","source":{"kind":"arxiv","id":"1702.03959","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03959","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03959v1","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03959","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"EQJ3V7LX2WDQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQJ3V7LX2WDQTQIJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQJ3V7LX","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EQJ3V7LX2WDQTQIJ5RLE3BF3JZ","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-13T19:35:15Z","cross_cats_sorted":[],"title_canon_sha256":"b25073ff1b9f5ed2aff71624d36f30524a6e042cd32edf7428437d9591acba88","abstract_canon_sha256":"471c6cdc258dc0aeb15068ba386365d7ec23f75b8ca566b29b7f6e84b89698f4"},"schema_version":"1.0"},"canonical_sha256":"2413bafd77d58709c109ec564d84bb4e76d7d2ada8de5013312742eca8925d91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:51.524147Z","signature_b64":"2B+x1J37ZJsYzGYcREHxtLdS/+4pqZ/Q4u9Im/OV5PmTcqtnDY3pazS/WcKyeSzmlXJjVZGFR3ZYzuoD07YCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2413bafd77d58709c109ec564d84bb4e76d7d2ada8de5013312742eca8925d91","last_reissued_at":"2026-05-18T00:50:51.523671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:51.523671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03959","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:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHOFUu3SEdZNnKLylqqkJq4kIwJWogbY0fu/SQtV37UG1Kz862BYuO+fjt+kFLyywhe1tDEsMGTUpFnFRh01AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:37:07.397216Z"},"content_sha256":"f0989dea929b3bbf12c5390498aa1db2c5c5c44e4f479d6878ae5aaaf43cb7d2","schema_version":"1.0","event_id":"sha256:f0989dea929b3bbf12c5390498aa1db2c5c5c44e4f479d6878ae5aaaf43cb7d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EQJ3V7LX2WDQTQIJ5RLE3BF3JZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How large is your graph?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frederik Mallmann-Trenn, Varun Kanade, Victor Verdugo","submitted_at":"2017-02-13T19:35:15Z","abstract_excerpt":"We consider the problem of estimating the graph size, where one is given only local access to the graph. We formally define a query model in which one starts with a \\emph{seed} node and is allowed to make queries about neighbours of nodes that have already been seen. In the case of undirected graphs, an estimator of Katzir et al. (2014) based on a sample from the stationary distribution $\\pi$ uses $O\\left(\\frac{1}{\\|\\pi\\|_2} + \\text{davg}\\right)$ queries, we prove that this is tight. In addition, we establish this as a lower bound even when the algorithm is allowed to crawl the graph arbitrari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03959","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:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1xpLiorX+Jg7KNuxCKIMUNbHkV4mOBCuK4kUOnfoJ8TlDViWJjK+8a4wGrSTB5WJwbbmHeNuyWgUIjHwVgGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T17:37:07.397576Z"},"content_sha256":"f491e7d26ab2f035d7e5587c9a5eb38d59420f5bcf06e4e49d51a4ba5557efbf","schema_version":"1.0","event_id":"sha256:f491e7d26ab2f035d7e5587c9a5eb38d59420f5bcf06e4e49d51a4ba5557efbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQJ3V7LX2WDQTQIJ5RLE3BF3JZ/bundle.json","state_url":"https://pith.science/pith/EQJ3V7LX2WDQTQIJ5RLE3BF3JZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQJ3V7LX2WDQTQIJ5RLE3BF3JZ/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-19T17:37:07Z","links":{"resolver":"https://pith.science/pith/EQJ3V7LX2WDQTQIJ5RLE3BF3JZ","bundle":"https://pith.science/pith/EQJ3V7LX2WDQTQIJ5RLE3BF3JZ/bundle.json","state":"https://pith.science/pith/EQJ3V7LX2WDQTQIJ5RLE3BF3JZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQJ3V7LX2WDQTQIJ5RLE3BF3JZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EQJ3V7LX2WDQTQIJ5RLE3BF3JZ","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":"471c6cdc258dc0aeb15068ba386365d7ec23f75b8ca566b29b7f6e84b89698f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-13T19:35:15Z","title_canon_sha256":"b25073ff1b9f5ed2aff71624d36f30524a6e042cd32edf7428437d9591acba88"},"schema_version":"1.0","source":{"id":"1702.03959","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03959","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03959v1","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03959","created_at":"2026-05-18T00:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"EQJ3V7LX2WDQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQJ3V7LX2WDQTQIJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQJ3V7LX","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:f491e7d26ab2f035d7e5587c9a5eb38d59420f5bcf06e4e49d51a4ba5557efbf","target":"graph","created_at":"2026-05-18T00:50:51Z","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":"We consider the problem of estimating the graph size, where one is given only local access to the graph. We formally define a query model in which one starts with a \\emph{seed} node and is allowed to make queries about neighbours of nodes that have already been seen. In the case of undirected graphs, an estimator of Katzir et al. (2014) based on a sample from the stationary distribution $\\pi$ uses $O\\left(\\frac{1}{\\|\\pi\\|_2} + \\text{davg}\\right)$ queries, we prove that this is tight. In addition, we establish this as a lower bound even when the algorithm is allowed to crawl the graph arbitrari","authors_text":"Frederik Mallmann-Trenn, Varun Kanade, Victor Verdugo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-13T19:35:15Z","title":"How large is your graph?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03959","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:f0989dea929b3bbf12c5390498aa1db2c5c5c44e4f479d6878ae5aaaf43cb7d2","target":"record","created_at":"2026-05-18T00:50:51Z","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":"471c6cdc258dc0aeb15068ba386365d7ec23f75b8ca566b29b7f6e84b89698f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-13T19:35:15Z","title_canon_sha256":"b25073ff1b9f5ed2aff71624d36f30524a6e042cd32edf7428437d9591acba88"},"schema_version":"1.0","source":{"id":"1702.03959","kind":"arxiv","version":1}},"canonical_sha256":"2413bafd77d58709c109ec564d84bb4e76d7d2ada8de5013312742eca8925d91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2413bafd77d58709c109ec564d84bb4e76d7d2ada8de5013312742eca8925d91","first_computed_at":"2026-05-18T00:50:51.523671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:51.523671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2B+x1J37ZJsYzGYcREHxtLdS/+4pqZ/Q4u9Im/OV5PmTcqtnDY3pazS/WcKyeSzmlXJjVZGFR3ZYzuoD07YCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:51.524147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03959","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0989dea929b3bbf12c5390498aa1db2c5c5c44e4f479d6878ae5aaaf43cb7d2","sha256:f491e7d26ab2f035d7e5587c9a5eb38d59420f5bcf06e4e49d51a4ba5557efbf"],"state_sha256":"fa51c0bef5defc39bcb51e17902f014d153cae20e3b5f2e1ba2cde7ad88472ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWffhyDnR1hv6jaKyf640VA1RJ2nNoW4aMaGJrBslom7sqqwJAiuVVAMmWx6Lu+TotnrWzADopa4+R0USxkBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T17:37:07.399519Z","bundle_sha256":"3d7ac52c5d1c7cc107e7d7c7cf20593db83abf93d2f25870fee26e990ca1e10f"}}