{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L2MREGP7CTDLFIX43XCL6T4YI3","short_pith_number":"pith:L2MREGP7","canonical_record":{"source":{"id":"1208.0615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-02T20:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"4263ddf6449eaff5c46de2a550c186a2e072fe42f74cba032c21ace261e5e47f","abstract_canon_sha256":"b91039359fabb04e3e1855bfb1d4e62ed8008758a40bd204a10070a7f07cd7c9"},"schema_version":"1.0"},"canonical_sha256":"5e991219ff14c6b2a2fcddc4bf4f9846ebba08fb142feb4df004c4b610fe23e9","source":{"kind":"arxiv","id":"1208.0615","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0615","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0615v2","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0615","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"L2MREGP7CTDL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"L2MREGP7CTDLFIX4","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"L2MREGP7","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L2MREGP7CTDLFIX43XCL6T4YI3","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-02T20:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"4263ddf6449eaff5c46de2a550c186a2e072fe42f74cba032c21ace261e5e47f","abstract_canon_sha256":"b91039359fabb04e3e1855bfb1d4e62ed8008758a40bd204a10070a7f07cd7c9"},"schema_version":"1.0"},"canonical_sha256":"5e991219ff14c6b2a2fcddc4bf4f9846ebba08fb142feb4df004c4b610fe23e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:15.968219Z","signature_b64":"9MK42A+zHxqcwKZOeJdSBhvwGU9/KNBmX2Rkjn91BMubmqYQ/y8KN3Y1aRuYR//UCFrADBLG+Er/rKPRXd25AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e991219ff14c6b2a2fcddc4bf4f9846ebba08fb142feb4df004c4b610fe23e9","last_reissued_at":"2026-05-18T03:40:15.967474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:15.967474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0615","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-05-18T03:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8e7ZQB4Km1Pc5b2dq/0NAeYekgoohV+d8l8IQr/j8RPZ2PatOf2Z31qczbN0JUkHmn3CJWVaH2aDHnY2GKamDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:28:23.223671Z"},"content_sha256":"b7a32956f5be7927ffa086ab213a4aa30e0b85465218dc437cb00b19985b117d","schema_version":"1.0","event_id":"sha256:b7a32956f5be7927ffa086ab213a4aa30e0b85465218dc437cb00b19985b117d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L2MREGP7CTDLFIX43XCL6T4YI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumerating Subgraph Instances Using Map-Reduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dimitris Fotakis, Foto N. Afrati, Jeffrey D. Ullman","submitted_at":"2012-08-02T20:56:39Z","abstract_excerpt":"The theme of this paper is how to find all instances of a given \"sample\" graph in a larger \"data graph,\" using a single round of map-reduce. For the simplest sample graph, the triangle, we improve upon the best known such algorithm. We then examine the general case, considering both the communication cost between mappers and reducers and the total computation cost at the reducers. To minimize communication cost, we exploit the techniques of (Afrati and Ullman, TKDE 2011)for computing multiway joins (evaluating conjunctive queries) in a single map-reduce round. Several methods are shown for tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0615","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":""},"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-18T03:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aj+72zGgC88jsDN5+jabqOEKTe6lnlCe+ZNDVa4SkVRQHKRm6T/8LcVKU4mj0wTPhzRzcPNOywsGJU9OLYFoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:28:23.224237Z"},"content_sha256":"b2e10a2880cbf1e47c1cadfaa10aee92c725eaca592d2638ed6960be8c56800b","schema_version":"1.0","event_id":"sha256:b2e10a2880cbf1e47c1cadfaa10aee92c725eaca592d2638ed6960be8c56800b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2MREGP7CTDLFIX43XCL6T4YI3/bundle.json","state_url":"https://pith.science/pith/L2MREGP7CTDLFIX43XCL6T4YI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2MREGP7CTDLFIX43XCL6T4YI3/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-06-22T21:28:23Z","links":{"resolver":"https://pith.science/pith/L2MREGP7CTDLFIX43XCL6T4YI3","bundle":"https://pith.science/pith/L2MREGP7CTDLFIX43XCL6T4YI3/bundle.json","state":"https://pith.science/pith/L2MREGP7CTDLFIX43XCL6T4YI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2MREGP7CTDLFIX43XCL6T4YI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L2MREGP7CTDLFIX43XCL6T4YI3","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":"b91039359fabb04e3e1855bfb1d4e62ed8008758a40bd204a10070a7f07cd7c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-02T20:56:39Z","title_canon_sha256":"4263ddf6449eaff5c46de2a550c186a2e072fe42f74cba032c21ace261e5e47f"},"schema_version":"1.0","source":{"id":"1208.0615","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0615","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0615v2","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0615","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"L2MREGP7CTDL","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"L2MREGP7CTDLFIX4","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"L2MREGP7","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:b2e10a2880cbf1e47c1cadfaa10aee92c725eaca592d2638ed6960be8c56800b","target":"graph","created_at":"2026-05-18T03:40: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":"The theme of this paper is how to find all instances of a given \"sample\" graph in a larger \"data graph,\" using a single round of map-reduce. For the simplest sample graph, the triangle, we improve upon the best known such algorithm. We then examine the general case, considering both the communication cost between mappers and reducers and the total computation cost at the reducers. To minimize communication cost, we exploit the techniques of (Afrati and Ullman, TKDE 2011)for computing multiway joins (evaluating conjunctive queries) in a single map-reduce round. Several methods are shown for tra","authors_text":"Dimitris Fotakis, Foto N. Afrati, Jeffrey D. Ullman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-02T20:56:39Z","title":"Enumerating Subgraph Instances Using Map-Reduce"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0615","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:b7a32956f5be7927ffa086ab213a4aa30e0b85465218dc437cb00b19985b117d","target":"record","created_at":"2026-05-18T03:40: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":"b91039359fabb04e3e1855bfb1d4e62ed8008758a40bd204a10070a7f07cd7c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-02T20:56:39Z","title_canon_sha256":"4263ddf6449eaff5c46de2a550c186a2e072fe42f74cba032c21ace261e5e47f"},"schema_version":"1.0","source":{"id":"1208.0615","kind":"arxiv","version":2}},"canonical_sha256":"5e991219ff14c6b2a2fcddc4bf4f9846ebba08fb142feb4df004c4b610fe23e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e991219ff14c6b2a2fcddc4bf4f9846ebba08fb142feb4df004c4b610fe23e9","first_computed_at":"2026-05-18T03:40:15.967474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:15.967474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9MK42A+zHxqcwKZOeJdSBhvwGU9/KNBmX2Rkjn91BMubmqYQ/y8KN3Y1aRuYR//UCFrADBLG+Er/rKPRXd25AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:15.968219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0615","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7a32956f5be7927ffa086ab213a4aa30e0b85465218dc437cb00b19985b117d","sha256:b2e10a2880cbf1e47c1cadfaa10aee92c725eaca592d2638ed6960be8c56800b"],"state_sha256":"9abff79c3c8cf0ce753f81cbb783216e128b676aadb095c01f11506116115b1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjCWCyBZ4jK1mC35xXpTNjI6vuynpnPAP9msi910/WQ3VlqZlIzThG+fmA62ellODEDPZXcWWzbFTR5L8eb+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:28:23.226864Z","bundle_sha256":"51a8baf2d06e66a0b7a6f61f50f6caccaad6bf0d9faf3434d68ab3f74464fcf8"}}