{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SZ3DOEVRB66BQKNMLLM4UNHC6L","short_pith_number":"pith:SZ3DOEVR","canonical_record":{"source":{"id":"1510.05179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-17T23:09:49Z","cross_cats_sorted":["cs.DS","math.RA"],"title_canon_sha256":"e4bc48652d70a06dcbf90ec4c92f0df92fcef36849a325d7c03219a98cb9d938","abstract_canon_sha256":"047c98600dbe634d30c966feca6e596da4878c346cbd3894746bb1885c66acc7"},"schema_version":"1.0"},"canonical_sha256":"96763712b10fbc1829ac5ad9ca34e2f2ea7bc19fd9e84f63b2d047bd36d0d184","source":{"kind":"arxiv","id":"1510.05179","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05179","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05179v1","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05179","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"SZ3DOEVRB66B","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SZ3DOEVRB66BQKNM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SZ3DOEVR","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SZ3DOEVRB66BQKNMLLM4UNHC6L","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-17T23:09:49Z","cross_cats_sorted":["cs.DS","math.RA"],"title_canon_sha256":"e4bc48652d70a06dcbf90ec4c92f0df92fcef36849a325d7c03219a98cb9d938","abstract_canon_sha256":"047c98600dbe634d30c966feca6e596da4878c346cbd3894746bb1885c66acc7"},"schema_version":"1.0"},"canonical_sha256":"96763712b10fbc1829ac5ad9ca34e2f2ea7bc19fd9e84f63b2d047bd36d0d184","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:40.496408Z","signature_b64":"JaITk40IBb/Gjvm1p5C3eqBPfI5ZqTcz/JJ/lTuXxrIZdootuSGEM0KdeYPk0Vpv/MwXef3w3n/O7vc9cl8hBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96763712b10fbc1829ac5ad9ca34e2f2ea7bc19fd9e84f63b2d047bd36d0d184","last_reissued_at":"2026-05-18T00:53:40.495946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:40.495946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05179","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:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6NvEZgJuISP5MZrRIpYa9e6WPvf9cGs3CBZYdVWGb/EQI/qfxSMQv6y/O4XkVxqRdPCdWT48JdxR/XLJGvxWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:00:16.539355Z"},"content_sha256":"0408727aefbc8823525eb4493121447ceed8e94cee59135741bea18684a1b12f","schema_version":"1.0","event_id":"sha256:0408727aefbc8823525eb4493121447ceed8e94cee59135741bea18684a1b12f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SZ3DOEVRB66BQKNMLLM4UNHC6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic Conditions for Generating Accurate Adjacency Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.RA"],"primary_cat":"cs.DB","authors_text":"Hayden Jansen, Jeremy Kepner, Karia Dibert","submitted_at":"2015-10-17T23:09:49Z","abstract_excerpt":"Data processing systems impose multiple views on data as it is processed by the system. These views include spreadsheets, databases, matrices, and graphs. Associative arrays unify and simplify these different approaches into a common two-dimensional view of data. Graph construction, a fundamental operation in the 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 matrix of the graph that can be processed with a variety of machine learning clustering techniques"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05179","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:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRL0B98+maryXU4xrn/K5p2EHog/E4LZ2WMAWyzseoBG+qTabEju8ewxbT1eos6UDXecUIiTj70iKLm2froHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:00:16.539869Z"},"content_sha256":"459a370059b953473b3074a3f0fefbe1f82524751f915e54764ec2796c5e8cef","schema_version":"1.0","event_id":"sha256:459a370059b953473b3074a3f0fefbe1f82524751f915e54764ec2796c5e8cef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZ3DOEVRB66BQKNMLLM4UNHC6L/bundle.json","state_url":"https://pith.science/pith/SZ3DOEVRB66BQKNMLLM4UNHC6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZ3DOEVRB66BQKNMLLM4UNHC6L/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:00:16Z","links":{"resolver":"https://pith.science/pith/SZ3DOEVRB66BQKNMLLM4UNHC6L","bundle":"https://pith.science/pith/SZ3DOEVRB66BQKNMLLM4UNHC6L/bundle.json","state":"https://pith.science/pith/SZ3DOEVRB66BQKNMLLM4UNHC6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZ3DOEVRB66BQKNMLLM4UNHC6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SZ3DOEVRB66BQKNMLLM4UNHC6L","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":"047c98600dbe634d30c966feca6e596da4878c346cbd3894746bb1885c66acc7","cross_cats_sorted":["cs.DS","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-17T23:09:49Z","title_canon_sha256":"e4bc48652d70a06dcbf90ec4c92f0df92fcef36849a325d7c03219a98cb9d938"},"schema_version":"1.0","source":{"id":"1510.05179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05179","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05179v1","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05179","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"SZ3DOEVRB66B","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SZ3DOEVRB66BQKNM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SZ3DOEVR","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:459a370059b953473b3074a3f0fefbe1f82524751f915e54764ec2796c5e8cef","target":"graph","created_at":"2026-05-18T00:53:40Z","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":"Data processing systems impose multiple views on data as it is processed by the system. These views include spreadsheets, databases, matrices, and graphs. Associative arrays unify and simplify these different approaches into a common two-dimensional view of data. Graph construction, a fundamental operation in the 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 matrix of the graph that can be processed with a variety of machine learning clustering techniques","authors_text":"Hayden Jansen, Jeremy Kepner, Karia Dibert","cross_cats":["cs.DS","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-17T23:09:49Z","title":"Algebraic Conditions for Generating Accurate Adjacency Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05179","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:0408727aefbc8823525eb4493121447ceed8e94cee59135741bea18684a1b12f","target":"record","created_at":"2026-05-18T00:53:40Z","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":"047c98600dbe634d30c966feca6e596da4878c346cbd3894746bb1885c66acc7","cross_cats_sorted":["cs.DS","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-17T23:09:49Z","title_canon_sha256":"e4bc48652d70a06dcbf90ec4c92f0df92fcef36849a325d7c03219a98cb9d938"},"schema_version":"1.0","source":{"id":"1510.05179","kind":"arxiv","version":1}},"canonical_sha256":"96763712b10fbc1829ac5ad9ca34e2f2ea7bc19fd9e84f63b2d047bd36d0d184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96763712b10fbc1829ac5ad9ca34e2f2ea7bc19fd9e84f63b2d047bd36d0d184","first_computed_at":"2026-05-18T00:53:40.495946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:40.495946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JaITk40IBb/Gjvm1p5C3eqBPfI5ZqTcz/JJ/lTuXxrIZdootuSGEM0KdeYPk0Vpv/MwXef3w3n/O7vc9cl8hBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:40.496408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0408727aefbc8823525eb4493121447ceed8e94cee59135741bea18684a1b12f","sha256:459a370059b953473b3074a3f0fefbe1f82524751f915e54764ec2796c5e8cef"],"state_sha256":"6c567dff862c3effd9746eea6ccdfd613b750070c76b2975096249c155f1aa32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5mucTaN52izIDUQCknHMI0h0qyebw5ZFg+5hxn4+mlIDe8RT/whs58ocitrs9Ze0s6S7hXZ70l6V5M2n0kagCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:00:16.542532Z","bundle_sha256":"1e7c4450986555ae2a6f7ac48f6491d13e0931a5089799ff7493624dfb1f6208"}}