{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MYCCQ3UREMXXH2EFF56FFYM7JE","short_pith_number":"pith:MYCCQ3UR","canonical_record":{"source":{"id":"2107.06582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T10:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"50c6a578b1157f7bc740d205e0721ac3513c670f34897a46d93430f42cf017aa","abstract_canon_sha256":"2834988c3a11441a3b7bfcd914617d073e63f991ecc4aa639cb155a22a4d333a"},"schema_version":"1.0"},"canonical_sha256":"6604286e91232f73e8852f7c52e19f491bc92e2c6e637b810b550766960a591e","source":{"kind":"arxiv","id":"2107.06582","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06582","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06582v2","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06582","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"MYCCQ3UREMXX","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"pith_short_16","alias_value":"MYCCQ3UREMXXH2EF","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"pith_short_8","alias_value":"MYCCQ3UR","created_at":"2026-07-05T02:58:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MYCCQ3UREMXXH2EFF56FFYM7JE","target":"record","payload":{"canonical_record":{"source":{"id":"2107.06582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T10:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"50c6a578b1157f7bc740d205e0721ac3513c670f34897a46d93430f42cf017aa","abstract_canon_sha256":"2834988c3a11441a3b7bfcd914617d073e63f991ecc4aa639cb155a22a4d333a"},"schema_version":"1.0"},"canonical_sha256":"6604286e91232f73e8852f7c52e19f491bc92e2c6e637b810b550766960a591e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:44.077532Z","signature_b64":"PCgYphsQJGg5Dgk0pZCFB77mF5Ff1+6mK2YyuE9S1sPbiAqOcoSj6JFyA7n5q4lb0IrpLYb+cjWPRF45LO6PDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6604286e91232f73e8852f7c52e19f491bc92e2c6e637b810b550766960a591e","last_reissued_at":"2026-07-05T02:58:44.077121Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:44.077121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.06582","source_version":2,"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-05T02:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+muN/+KtEuIgvw0rg6KS+0dWG2MZkERJdbySddjyYGAFeQKP/yeV/PTTWsz5tlfPnxs77ETyH1U9zIM/cPRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:41:31.119296Z"},"content_sha256":"bcce04a417f8b65908067f6bc006e500b5352a291bed71892b2eff08b7eaf98d","schema_version":"1.0","event_id":"sha256:bcce04a417f8b65908067f6bc006e500b5352a291bed71892b2eff08b7eaf98d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MYCCQ3UREMXXH2EFF56FFYM7JE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amartya Shankha Biswas, Ronitt Rubinfeld, Talya Eden","submitted_at":"2021-07-14T10:05:26Z","abstract_excerpt":"We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms for these tasks were based on a decomposition of $H$ into a collection of odd cycles and stars, denoted $\\mathcal{D}^*(H)=\\{O_{k_1}, \\ldots, O_{k_q}, S_{p_1}, \\ldots, S_{p_\\ell}\\}$. These algorithms were shown to be optimal for the case where $H$ is a clique or an odd-length cycle, but no other lower bounds were known.\n  We present a new algorithm for sampling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06582","kind":"arxiv","version":2},"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/2107.06582/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-05T02:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ob6ZzOOQ6H0+MwoLORRF6FN1WNuXy8gHujK6BM/mVtqfLXEI8PiSLnbV7uvprI27DpuNIJCtT0xs6HfNDfETAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:41:31.119678Z"},"content_sha256":"eca2bee27a948ef996763d2792fda4ccd0ae97703ec8e4206e0d911c6a3aa3b4","schema_version":"1.0","event_id":"sha256:eca2bee27a948ef996763d2792fda4ccd0ae97703ec8e4206e0d911c6a3aa3b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYCCQ3UREMXXH2EFF56FFYM7JE/bundle.json","state_url":"https://pith.science/pith/MYCCQ3UREMXXH2EFF56FFYM7JE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYCCQ3UREMXXH2EFF56FFYM7JE/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-07T09:41:31Z","links":{"resolver":"https://pith.science/pith/MYCCQ3UREMXXH2EFF56FFYM7JE","bundle":"https://pith.science/pith/MYCCQ3UREMXXH2EFF56FFYM7JE/bundle.json","state":"https://pith.science/pith/MYCCQ3UREMXXH2EFF56FFYM7JE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYCCQ3UREMXXH2EFF56FFYM7JE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MYCCQ3UREMXXH2EFF56FFYM7JE","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":"2834988c3a11441a3b7bfcd914617d073e63f991ecc4aa639cb155a22a4d333a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T10:05:26Z","title_canon_sha256":"50c6a578b1157f7bc740d205e0721ac3513c670f34897a46d93430f42cf017aa"},"schema_version":"1.0","source":{"id":"2107.06582","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06582","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06582v2","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06582","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"MYCCQ3UREMXX","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"pith_short_16","alias_value":"MYCCQ3UREMXXH2EF","created_at":"2026-07-05T02:58:44Z"},{"alias_kind":"pith_short_8","alias_value":"MYCCQ3UR","created_at":"2026-07-05T02:58:44Z"}],"graph_snapshots":[{"event_id":"sha256:eca2bee27a948ef996763d2792fda4ccd0ae97703ec8e4206e0d911c6a3aa3b4","target":"graph","created_at":"2026-07-05T02:58:44Z","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/2107.06582/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms for these tasks were based on a decomposition of $H$ into a collection of odd cycles and stars, denoted $\\mathcal{D}^*(H)=\\{O_{k_1}, \\ldots, O_{k_q}, S_{p_1}, \\ldots, S_{p_\\ell}\\}$. These algorithms were shown to be optimal for the case where $H$ is a clique or an odd-length cycle, but no other lower bounds were known.\n  We present a new algorithm for sampling","authors_text":"Amartya Shankha Biswas, Ronitt Rubinfeld, Talya Eden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T10:05:26Z","title":"Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06582","kind":"arxiv","version":2},"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:bcce04a417f8b65908067f6bc006e500b5352a291bed71892b2eff08b7eaf98d","target":"record","created_at":"2026-07-05T02:58:44Z","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":"2834988c3a11441a3b7bfcd914617d073e63f991ecc4aa639cb155a22a4d333a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-07-14T10:05:26Z","title_canon_sha256":"50c6a578b1157f7bc740d205e0721ac3513c670f34897a46d93430f42cf017aa"},"schema_version":"1.0","source":{"id":"2107.06582","kind":"arxiv","version":2}},"canonical_sha256":"6604286e91232f73e8852f7c52e19f491bc92e2c6e637b810b550766960a591e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6604286e91232f73e8852f7c52e19f491bc92e2c6e637b810b550766960a591e","first_computed_at":"2026-07-05T02:58:44.077121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:58:44.077121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PCgYphsQJGg5Dgk0pZCFB77mF5Ff1+6mK2YyuE9S1sPbiAqOcoSj6JFyA7n5q4lb0IrpLYb+cjWPRF45LO6PDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:58:44.077532Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.06582","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcce04a417f8b65908067f6bc006e500b5352a291bed71892b2eff08b7eaf98d","sha256:eca2bee27a948ef996763d2792fda4ccd0ae97703ec8e4206e0d911c6a3aa3b4"],"state_sha256":"ee1eac032e03a53f46789f08723b29d6b8022569aa33b98daf1728f1c41e184c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RPB8vmiQyQZ+Ha6Gl6H3CldBSwAMEn2ZkVtsM6Jrk5NeXjrxQ4AtEK3qdDgbLQz1Rr3akQm+927RtKV3pnkqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:41:31.121662Z","bundle_sha256":"5e48a6febd9948e2172978827e5c689394dc4dc7655dab0ab8e9a0e633b0b0a0"}}