{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3KY3RSF2TAVG4LC5FW2JUXP4TX","short_pith_number":"pith:3KY3RSF2","canonical_record":{"source":{"id":"1906.01599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-04T17:22:07Z","cross_cats_sorted":["cs.DM","cs.IR"],"title_canon_sha256":"2c271fdfab5720b9cdb6a05d10be2f09b6f9a5a0c00e242104ab2db8eac12e00","abstract_canon_sha256":"3846fab13b6bbefc8b33ffbea77c4f2c52b586cce0a9098c02f52ac7f02a5837"},"schema_version":"1.0"},"canonical_sha256":"dab1b8c8ba982a6e2c5d2db49a5dfc9dd887c76dda56f44350fb0ac4f1293543","source":{"kind":"arxiv","id":"1906.01599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01599","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01599v1","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01599","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"3KY3RSF2TAVG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3KY3RSF2TAVG4LC5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3KY3RSF2","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3KY3RSF2TAVG4LC5FW2JUXP4TX","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-04T17:22:07Z","cross_cats_sorted":["cs.DM","cs.IR"],"title_canon_sha256":"2c271fdfab5720b9cdb6a05d10be2f09b6f9a5a0c00e242104ab2db8eac12e00","abstract_canon_sha256":"3846fab13b6bbefc8b33ffbea77c4f2c52b586cce0a9098c02f52ac7f02a5837"},"schema_version":"1.0"},"canonical_sha256":"dab1b8c8ba982a6e2c5d2db49a5dfc9dd887c76dda56f44350fb0ac4f1293543","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:16.009747Z","signature_b64":"bsx9FqVBlQf1OtpVFYIFBRtCBwxtcdy2kc57+ybqhwmVOzP9z83yTRcSyYw+zzvRvZ8ED1GQGAxP/IAaQvWnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dab1b8c8ba982a6e2c5d2db49a5dfc9dd887c76dda56f44350fb0ac4f1293543","last_reissued_at":"2026-05-17T23:44:16.009039Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:16.009039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01599","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-17T23:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82e5eE3it1EHwNupBZsYYr+R13tFEN83qmViibspdDiSU/yfjw71mVMiyBgS2X0UbpJy5CQ2Ctlu7QI+MKSBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:29:01.979708Z"},"content_sha256":"c740a0755e7113713f15c5a4d73871ec66706b691fc525b2e440af95edaafea7","schema_version":"1.0","event_id":"sha256:c740a0755e7113713f15c5a4d73871ec66706b691fc525b2e440af95edaafea7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3KY3RSF2TAVG4LC5FW2JUXP4TX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Motivo: fast motif counting via succinct color coding and adaptive sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IR"],"primary_cat":"cs.DB","authors_text":"Alessandro Panconesi, Marco Bressan, Stefano Leucci","submitted_at":"2019-06-04T17:22:07Z","abstract_excerpt":"The randomized technique of color coding is behind state-of-the-art algorithms for estimating graph motif counts. Those algorithms, however, are not yet capable of scaling well to very large graphs with billions of edges. In this paper we develop novel tools for the `motif counting via color coding' framework. As a result, our new algorithm, Motivo, is able to scale well to larger graphs while at the same time provide more accurate graphlet counts than ever before. This is achieved thanks to two types of improvements. First, we design new succinct data structures that support fast common color"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01599","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-17T23:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMN/3gT1cGtlry1dYC9fvqngR1G7lArr7YJo5rI8nHkR7DnuJVGCuOIsMetggQLUOA0cMlFFRe7bTCEhE852Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:29:01.980384Z"},"content_sha256":"06feedec8259f61dea685bb4bf642197dc6c3b13c48f6f5cc48d54592dd094a7","schema_version":"1.0","event_id":"sha256:06feedec8259f61dea685bb4bf642197dc6c3b13c48f6f5cc48d54592dd094a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KY3RSF2TAVG4LC5FW2JUXP4TX/bundle.json","state_url":"https://pith.science/pith/3KY3RSF2TAVG4LC5FW2JUXP4TX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KY3RSF2TAVG4LC5FW2JUXP4TX/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-23T22:29:01Z","links":{"resolver":"https://pith.science/pith/3KY3RSF2TAVG4LC5FW2JUXP4TX","bundle":"https://pith.science/pith/3KY3RSF2TAVG4LC5FW2JUXP4TX/bundle.json","state":"https://pith.science/pith/3KY3RSF2TAVG4LC5FW2JUXP4TX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KY3RSF2TAVG4LC5FW2JUXP4TX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3KY3RSF2TAVG4LC5FW2JUXP4TX","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":"3846fab13b6bbefc8b33ffbea77c4f2c52b586cce0a9098c02f52ac7f02a5837","cross_cats_sorted":["cs.DM","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-04T17:22:07Z","title_canon_sha256":"2c271fdfab5720b9cdb6a05d10be2f09b6f9a5a0c00e242104ab2db8eac12e00"},"schema_version":"1.0","source":{"id":"1906.01599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01599","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01599v1","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01599","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"3KY3RSF2TAVG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3KY3RSF2TAVG4LC5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3KY3RSF2","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:06feedec8259f61dea685bb4bf642197dc6c3b13c48f6f5cc48d54592dd094a7","target":"graph","created_at":"2026-05-17T23:44: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"},"paper":{"abstract_excerpt":"The randomized technique of color coding is behind state-of-the-art algorithms for estimating graph motif counts. Those algorithms, however, are not yet capable of scaling well to very large graphs with billions of edges. In this paper we develop novel tools for the `motif counting via color coding' framework. As a result, our new algorithm, Motivo, is able to scale well to larger graphs while at the same time provide more accurate graphlet counts than ever before. This is achieved thanks to two types of improvements. First, we design new succinct data structures that support fast common color","authors_text":"Alessandro Panconesi, Marco Bressan, Stefano Leucci","cross_cats":["cs.DM","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-04T17:22:07Z","title":"Motivo: fast motif counting via succinct color coding and adaptive sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01599","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:c740a0755e7113713f15c5a4d73871ec66706b691fc525b2e440af95edaafea7","target":"record","created_at":"2026-05-17T23:44: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":"3846fab13b6bbefc8b33ffbea77c4f2c52b586cce0a9098c02f52ac7f02a5837","cross_cats_sorted":["cs.DM","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-04T17:22:07Z","title_canon_sha256":"2c271fdfab5720b9cdb6a05d10be2f09b6f9a5a0c00e242104ab2db8eac12e00"},"schema_version":"1.0","source":{"id":"1906.01599","kind":"arxiv","version":1}},"canonical_sha256":"dab1b8c8ba982a6e2c5d2db49a5dfc9dd887c76dda56f44350fb0ac4f1293543","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dab1b8c8ba982a6e2c5d2db49a5dfc9dd887c76dda56f44350fb0ac4f1293543","first_computed_at":"2026-05-17T23:44:16.009039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:16.009039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsx9FqVBlQf1OtpVFYIFBRtCBwxtcdy2kc57+ybqhwmVOzP9z83yTRcSyYw+zzvRvZ8ED1GQGAxP/IAaQvWnAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:16.009747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c740a0755e7113713f15c5a4d73871ec66706b691fc525b2e440af95edaafea7","sha256:06feedec8259f61dea685bb4bf642197dc6c3b13c48f6f5cc48d54592dd094a7"],"state_sha256":"7cd52329f6ca1e6db38351dd5d35b59c242b029a7fe57adbe51f5f097df628e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d47TYmvXUbBdEJlVJMuM+UL2m4BjI9sYEc4/FG7Ke4zAAvgTTjoTptA6GNPxSKGuM0IWE6rWKUQv/PTuM6qRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T22:29:01.983913Z","bundle_sha256":"e485aca55f0b60d0fe1365777e48433d7c9735b779dd8f12fd41f5ba8eee9d7e"}}