{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UESH6ICQKNKGS6N322TVPEGGQB","short_pith_number":"pith:UESH6ICQ","canonical_record":{"source":{"id":"1702.07832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-25T04:13:22Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"14d30c015cd722badc8a9a0af7725b849825110ebcd32ab85b9712a4b5dc8944","abstract_canon_sha256":"63246afd9ee0f3f93bd4e0665083e73e0e52355d6d56065fde15a97c563d1018"},"schema_version":"1.0"},"canonical_sha256":"a1247f205053546979bbd6a75790c6804c956de85ddc3c9cf5c5d63b53d1e21d","source":{"kind":"arxiv","id":"1702.07832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07832","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07832v1","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07832","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"UESH6ICQKNKG","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UESH6ICQKNKGS6N3","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UESH6ICQ","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UESH6ICQKNKGS6N322TVPEGGQB","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-25T04:13:22Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"14d30c015cd722badc8a9a0af7725b849825110ebcd32ab85b9712a4b5dc8944","abstract_canon_sha256":"63246afd9ee0f3f93bd4e0665083e73e0e52355d6d56065fde15a97c563d1018"},"schema_version":"1.0"},"canonical_sha256":"a1247f205053546979bbd6a75790c6804c956de85ddc3c9cf5c5d63b53d1e21d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:04.668194Z","signature_b64":"VvZbFL0/cMXPPPlns7iN/DKJt7Evwf5ChPa/acen/2wZcLhyJla5ZcM4tdAT3nOPj3buvUEJeh8Ze4qj/zKXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1247f205053546979bbd6a75790c6804c956de85ddc3c9cf5c5d63b53d1e21d","last_reissued_at":"2026-05-18T00:35:04.667514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:04.667514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07832","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:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAUAbyW3NopjBMyg5F3SLuaaKC3docCZjE/5fTV5+J81dXxsDpYS20pvFuk+l9TkOpcGiSQc0rxUvRwvT9iNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:28:00.561520Z"},"content_sha256":"b09474ec770240ffac8542372f5660c7b704a98574ebbe5a34a69caecd1bb537","schema_version":"1.0","event_id":"sha256:b09474ec770240ffac8542372f5660c7b704a98574ebbe5a34a69caecd1bb537"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UESH6ICQKNKGS6N322TVPEGGQB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing Adjacency Arrays from Incidence Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Hayden Jananthan, Jeremy Kepner, Karia Dibert","submitted_at":"2017-02-25T04:13:22Z","abstract_excerpt":"Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph, $\\mathbf{E}_\\mathrm{in}$ and $\\mathbf{E}_\\mathrm{out}$, to produce an adjacency array of the graph, $\\mathbf{A}$, that can be processed with a variety of algorithms. This paper provides the mathematical criteria to determine if the product $\\mathbf{A} = \\mathbf{E}^{\\sf T}_\\mathrm{out}\\mathbf{E}_\\mathrm{in}$ will have the required structure of the adjacency array of the graph. The values in the resulting adjacency array are determined by the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07832","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:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCzYulvFN1bWRPrjZck4AnQamWNsS04NfeFAFblafunc/jFmBI/S5eb4rDar/l8lnqVQ1lI7Icmj7cAccd3BBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:28:00.562222Z"},"content_sha256":"b28ecc7e5e4200f46a4900190aaf04b238012d2e089472745481f6fbcbf315fb","schema_version":"1.0","event_id":"sha256:b28ecc7e5e4200f46a4900190aaf04b238012d2e089472745481f6fbcbf315fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UESH6ICQKNKGS6N322TVPEGGQB/bundle.json","state_url":"https://pith.science/pith/UESH6ICQKNKGS6N322TVPEGGQB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UESH6ICQKNKGS6N322TVPEGGQB/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-06T16:28:00Z","links":{"resolver":"https://pith.science/pith/UESH6ICQKNKGS6N322TVPEGGQB","bundle":"https://pith.science/pith/UESH6ICQKNKGS6N322TVPEGGQB/bundle.json","state":"https://pith.science/pith/UESH6ICQKNKGS6N322TVPEGGQB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UESH6ICQKNKGS6N322TVPEGGQB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UESH6ICQKNKGS6N322TVPEGGQB","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":"63246afd9ee0f3f93bd4e0665083e73e0e52355d6d56065fde15a97c563d1018","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-25T04:13:22Z","title_canon_sha256":"14d30c015cd722badc8a9a0af7725b849825110ebcd32ab85b9712a4b5dc8944"},"schema_version":"1.0","source":{"id":"1702.07832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07832","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07832v1","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07832","created_at":"2026-05-18T00:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"UESH6ICQKNKG","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UESH6ICQKNKGS6N3","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UESH6ICQ","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:b28ecc7e5e4200f46a4900190aaf04b238012d2e089472745481f6fbcbf315fb","target":"graph","created_at":"2026-05-18T00:35:04Z","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":"Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph, $\\mathbf{E}_\\mathrm{in}$ and $\\mathbf{E}_\\mathrm{out}$, to produce an adjacency array of the graph, $\\mathbf{A}$, that can be processed with a variety of algorithms. This paper provides the mathematical criteria to determine if the product $\\mathbf{A} = \\mathbf{E}^{\\sf T}_\\mathrm{out}\\mathbf{E}_\\mathrm{in}$ will have the required structure of the adjacency array of the graph. The values in the resulting adjacency array are determined by the","authors_text":"Hayden Jananthan, Jeremy Kepner, Karia Dibert","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-25T04:13:22Z","title":"Constructing Adjacency Arrays from Incidence Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07832","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:b09474ec770240ffac8542372f5660c7b704a98574ebbe5a34a69caecd1bb537","target":"record","created_at":"2026-05-18T00:35:04Z","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":"63246afd9ee0f3f93bd4e0665083e73e0e52355d6d56065fde15a97c563d1018","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-25T04:13:22Z","title_canon_sha256":"14d30c015cd722badc8a9a0af7725b849825110ebcd32ab85b9712a4b5dc8944"},"schema_version":"1.0","source":{"id":"1702.07832","kind":"arxiv","version":1}},"canonical_sha256":"a1247f205053546979bbd6a75790c6804c956de85ddc3c9cf5c5d63b53d1e21d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1247f205053546979bbd6a75790c6804c956de85ddc3c9cf5c5d63b53d1e21d","first_computed_at":"2026-05-18T00:35:04.667514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:04.667514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VvZbFL0/cMXPPPlns7iN/DKJt7Evwf5ChPa/acen/2wZcLhyJla5ZcM4tdAT3nOPj3buvUEJeh8Ze4qj/zKXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:04.668194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b09474ec770240ffac8542372f5660c7b704a98574ebbe5a34a69caecd1bb537","sha256:b28ecc7e5e4200f46a4900190aaf04b238012d2e089472745481f6fbcbf315fb"],"state_sha256":"081a6e45bbe3f314b14c77373f0c197867ba04f546ade3f70c5eb1f40d73a7ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWMErunQJknb+1HNfYw+hNyBbeSUZqth8iW2ksGGLEfVaKBgtvXpOysDev+aHGojwCrci5CMYlv4KKtu+e22BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:28:00.566274Z","bundle_sha256":"76e03e86a70d044e9c9ad3eb532b526aaf6c2f49301d26c066e3667c061c9771"}}