{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AHU65TF6FU2N4MUANLZZODIN5H","short_pith_number":"pith:AHU65TF6","canonical_record":{"source":{"id":"1312.0723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T07:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"0e81fe5ce587c1d9eac8742efde838dc5e02ca1edba93fe81f7e57752e4d17d1","abstract_canon_sha256":"89d3ea86a4c2eada9c7dd1cec44f4a763ffcc9f76e0142919d21572c22e02007"},"schema_version":"1.0"},"canonical_sha256":"01e9eeccbe2d34de32806af3970d0de9eb94501338dbe5e613c92e5a4696e2a0","source":{"kind":"arxiv","id":"1312.0723","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0723","created_at":"2026-05-18T02:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0723v2","created_at":"2026-05-18T02:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0723","created_at":"2026-05-18T02:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"AHU65TF6FU2N","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AHU65TF6FU2N4MUA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AHU65TF6","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AHU65TF6FU2N4MUANLZZODIN5H","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T07:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"0e81fe5ce587c1d9eac8742efde838dc5e02ca1edba93fe81f7e57752e4d17d1","abstract_canon_sha256":"89d3ea86a4c2eada9c7dd1cec44f4a763ffcc9f76e0142919d21572c22e02007"},"schema_version":"1.0"},"canonical_sha256":"01e9eeccbe2d34de32806af3970d0de9eb94501338dbe5e613c92e5a4696e2a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:49.658269Z","signature_b64":"3G2SJHSh2Xh1ywSF58fOEdnOK1Qd6hUzzKGOTKfc5nezm2r+phlLljCk9sifbAjg32pZEuGJqRcB3DZtck7DAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01e9eeccbe2d34de32806af3970d0de9eb94501338dbe5e613c92e5a4696e2a0","last_reissued_at":"2026-05-18T02:55:49.657821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:49.657821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0723","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-18T02:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hohEQcnk6OcxidyeyFZeh+Ni1UgiIGxnSkkSSXljvf6cIgzZdhhAUiw02t+tXGrV6ikLpUB345OkFN76K2UDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:07:33.807805Z"},"content_sha256":"7e7cbc1ba623565f0982e9d307e4c55b6aeaf8a91521ac595fbae6f358be47d7","schema_version":"1.0","event_id":"sha256:7e7cbc1ba623565f0982e9d307e4c55b6aeaf8a91521ac595fbae6f358be47d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AHU65TF6FU2N4MUANLZZODIN5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Input/Output Complexity of Triangle Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Rasmus Pagh","submitted_at":"2013-12-03T07:54:00Z","abstract_excerpt":"We consider the well-known problem of enumerating all triangles of an undirected graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let $E$ be the number of edges, $M<E$ the size of internal memory, and $B$ the block size. The best results obtained previously are sort$(E^{3/2})$ I/Os (Dementiev, PhD thesis 2006) and $O(E^2/(MB))$ I/Os (Hu et al., SIGMOD 2013), where sort$(n)$ denotes the number of I/Os for sorting $n$ items. We improve the I/O complexity to $O(E^{3/2}/(\\sqrt{M} B))$ expected I/Os, which improves the previous bounds by a factor $\\min(\\sqrt{E/M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0723","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-18T02:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdWVHDlzg/M9169vqcW5MnqjXoZnnGyM/anX93ZF25thKNT0F4LcaLFRHQCbK7ONxZH309047RbVnt5n/+vVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:07:33.808149Z"},"content_sha256":"472f240971b28e4070e3207c781cd5180652fb6b412839060671f69ed343f69f","schema_version":"1.0","event_id":"sha256:472f240971b28e4070e3207c781cd5180652fb6b412839060671f69ed343f69f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H/bundle.json","state_url":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHU65TF6FU2N4MUANLZZODIN5H/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-03T19:07:33Z","links":{"resolver":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H","bundle":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H/bundle.json","state":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHU65TF6FU2N4MUANLZZODIN5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AHU65TF6FU2N4MUANLZZODIN5H","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":"89d3ea86a4c2eada9c7dd1cec44f4a763ffcc9f76e0142919d21572c22e02007","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T07:54:00Z","title_canon_sha256":"0e81fe5ce587c1d9eac8742efde838dc5e02ca1edba93fe81f7e57752e4d17d1"},"schema_version":"1.0","source":{"id":"1312.0723","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0723","created_at":"2026-05-18T02:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0723v2","created_at":"2026-05-18T02:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0723","created_at":"2026-05-18T02:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"AHU65TF6FU2N","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AHU65TF6FU2N4MUA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AHU65TF6","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:472f240971b28e4070e3207c781cd5180652fb6b412839060671f69ed343f69f","target":"graph","created_at":"2026-05-18T02:55:49Z","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 well-known problem of enumerating all triangles of an undirected graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let $E$ be the number of edges, $M<E$ the size of internal memory, and $B$ the block size. The best results obtained previously are sort$(E^{3/2})$ I/Os (Dementiev, PhD thesis 2006) and $O(E^2/(MB))$ I/Os (Hu et al., SIGMOD 2013), where sort$(n)$ denotes the number of I/Os for sorting $n$ items. We improve the I/O complexity to $O(E^{3/2}/(\\sqrt{M} B))$ expected I/Os, which improves the previous bounds by a factor $\\min(\\sqrt{E/M","authors_text":"Francesco Silvestri, Rasmus Pagh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T07:54:00Z","title":"The Input/Output Complexity of Triangle Enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0723","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:7e7cbc1ba623565f0982e9d307e4c55b6aeaf8a91521ac595fbae6f358be47d7","target":"record","created_at":"2026-05-18T02:55:49Z","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":"89d3ea86a4c2eada9c7dd1cec44f4a763ffcc9f76e0142919d21572c22e02007","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T07:54:00Z","title_canon_sha256":"0e81fe5ce587c1d9eac8742efde838dc5e02ca1edba93fe81f7e57752e4d17d1"},"schema_version":"1.0","source":{"id":"1312.0723","kind":"arxiv","version":2}},"canonical_sha256":"01e9eeccbe2d34de32806af3970d0de9eb94501338dbe5e613c92e5a4696e2a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01e9eeccbe2d34de32806af3970d0de9eb94501338dbe5e613c92e5a4696e2a0","first_computed_at":"2026-05-18T02:55:49.657821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:49.657821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3G2SJHSh2Xh1ywSF58fOEdnOK1Qd6hUzzKGOTKfc5nezm2r+phlLljCk9sifbAjg32pZEuGJqRcB3DZtck7DAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:49.658269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0723","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e7cbc1ba623565f0982e9d307e4c55b6aeaf8a91521ac595fbae6f358be47d7","sha256:472f240971b28e4070e3207c781cd5180652fb6b412839060671f69ed343f69f"],"state_sha256":"18358b2b6f83503c428bf181d046d875d10c9b61a68c4c19322897167b458315"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEFizexnFVt/thljnLTtAtOFES7VnpX6gBZfD8MQl8tJCVgeB3SIEMlKe5gZez7PRoMNXxD8WsJEQMbOMp4qCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:07:33.810282Z","bundle_sha256":"1697b36cd07d780b4ec8550689c569f048d3c5a00f4990b571d2c46cbba591f9"}}