{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:D6IPC5HLV4K7SU73O4RBQBNIKM","short_pith_number":"pith:D6IPC5HL","canonical_record":{"source":{"id":"1101.1941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-10T20:15:03Z","cross_cats_sorted":[],"title_canon_sha256":"95e498ea67b09beee249a387ed288ad4a809cb7674e8e50d6a8c510eb575892e","abstract_canon_sha256":"f4fd56ea10bf0c7b93facee3dc1cf9bd75e45c973d2dbf0036b8d234f8c3b6a2"},"schema_version":"1.0"},"canonical_sha256":"1f90f174ebaf15f953fb77221805a853335172b644df46ed62435336e69c28f5","source":{"kind":"arxiv","id":"1101.1941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1941","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1941v1","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1941","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"D6IPC5HLV4K7","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D6IPC5HLV4K7SU73","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D6IPC5HL","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:D6IPC5HLV4K7SU73O4RBQBNIKM","target":"record","payload":{"canonical_record":{"source":{"id":"1101.1941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-10T20:15:03Z","cross_cats_sorted":[],"title_canon_sha256":"95e498ea67b09beee249a387ed288ad4a809cb7674e8e50d6a8c510eb575892e","abstract_canon_sha256":"f4fd56ea10bf0c7b93facee3dc1cf9bd75e45c973d2dbf0036b8d234f8c3b6a2"},"schema_version":"1.0"},"canonical_sha256":"1f90f174ebaf15f953fb77221805a853335172b644df46ed62435336e69c28f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:51.366056Z","signature_b64":"gvY2aVy8VqCUnDjDxT40jRfFRBMPb03ATs4GbzUtM8g6IqGS+uLRWbDAGxHyxw8riF22XSzCSNXp4rzn/YaBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f90f174ebaf15f953fb77221805a853335172b644df46ed62435336e69c28f5","last_reissued_at":"2026-05-18T04:31:51.365615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:51.365615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.1941","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-18T04:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Khz5yrwbAuBx1ixgqiA02KUd5OP8fzuC2adqpo02o53BWwV6aNuk9cY2vqDSWRRejWNyqdois+77Z4FGCbmICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:45:07.023079Z"},"content_sha256":"783aa48b7dd1469037b3676afe44184b13b1f639db1f5b8f97be6be19eef8fdb","schema_version":"1.0","event_id":"sha256:783aa48b7dd1469037b3676afe44184b13b1f639db1f5b8f97be6be19eef8fdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:D6IPC5HLV4K7SU73O4RBQBNIKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Flip Korn, Howard Karloff, Konstantin Makarychev, Yuval Rabani","submitted_at":"2011-01-10T20:15:03Z","abstract_excerpt":"This paper studies the \"explanation problem\" for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensional tree-ordered case. In this paper, one is given a matrix A whose rows and columns have semantics: special subsets of the rows and special subsets of the columns are meaningful, others are not. A submatrix in A is said to be meaningful if and only if it is the cross product of a meaningful row subset and a meaningful column subset, in which case we call it an \"allowed rectangle.\" The goal is to \"explain\" A as a sparse sum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1941","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-18T04:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eUJIKfM5eNKkSzWtAACx/lUZFLi6XGChShxkKjzqZ7zspkI+8qWldH6RoYQ+0I9ZDnLjiP1drOfIa2vHFaxgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:45:07.023670Z"},"content_sha256":"6c17a57ba3c0e1601b0531c4af11b5fec6edb9c679d44790352f54374ffa7b97","schema_version":"1.0","event_id":"sha256:6c17a57ba3c0e1601b0531c4af11b5fec6edb9c679d44790352f54374ffa7b97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6IPC5HLV4K7SU73O4RBQBNIKM/bundle.json","state_url":"https://pith.science/pith/D6IPC5HLV4K7SU73O4RBQBNIKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6IPC5HLV4K7SU73O4RBQBNIKM/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-02T00:45:07Z","links":{"resolver":"https://pith.science/pith/D6IPC5HLV4K7SU73O4RBQBNIKM","bundle":"https://pith.science/pith/D6IPC5HLV4K7SU73O4RBQBNIKM/bundle.json","state":"https://pith.science/pith/D6IPC5HLV4K7SU73O4RBQBNIKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6IPC5HLV4K7SU73O4RBQBNIKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:D6IPC5HLV4K7SU73O4RBQBNIKM","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":"f4fd56ea10bf0c7b93facee3dc1cf9bd75e45c973d2dbf0036b8d234f8c3b6a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-10T20:15:03Z","title_canon_sha256":"95e498ea67b09beee249a387ed288ad4a809cb7674e8e50d6a8c510eb575892e"},"schema_version":"1.0","source":{"id":"1101.1941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1941","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1941v1","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1941","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"D6IPC5HLV4K7","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D6IPC5HLV4K7SU73","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D6IPC5HL","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:6c17a57ba3c0e1601b0531c4af11b5fec6edb9c679d44790352f54374ffa7b97","target":"graph","created_at":"2026-05-18T04:31:51Z","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":"This paper studies the \"explanation problem\" for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensional tree-ordered case. In this paper, one is given a matrix A whose rows and columns have semantics: special subsets of the rows and special subsets of the columns are meaningful, others are not. A submatrix in A is said to be meaningful if and only if it is the cross product of a meaningful row subset and a meaningful column subset, in which case we call it an \"allowed rectangle.\" The goal is to \"explain\" A as a sparse sum","authors_text":"Flip Korn, Howard Karloff, Konstantin Makarychev, Yuval Rabani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-10T20:15:03Z","title":"On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1941","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:783aa48b7dd1469037b3676afe44184b13b1f639db1f5b8f97be6be19eef8fdb","target":"record","created_at":"2026-05-18T04:31:51Z","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":"f4fd56ea10bf0c7b93facee3dc1cf9bd75e45c973d2dbf0036b8d234f8c3b6a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-10T20:15:03Z","title_canon_sha256":"95e498ea67b09beee249a387ed288ad4a809cb7674e8e50d6a8c510eb575892e"},"schema_version":"1.0","source":{"id":"1101.1941","kind":"arxiv","version":1}},"canonical_sha256":"1f90f174ebaf15f953fb77221805a853335172b644df46ed62435336e69c28f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f90f174ebaf15f953fb77221805a853335172b644df46ed62435336e69c28f5","first_computed_at":"2026-05-18T04:31:51.365615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:51.365615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gvY2aVy8VqCUnDjDxT40jRfFRBMPb03ATs4GbzUtM8g6IqGS+uLRWbDAGxHyxw8riF22XSzCSNXp4rzn/YaBBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:51.366056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.1941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:783aa48b7dd1469037b3676afe44184b13b1f639db1f5b8f97be6be19eef8fdb","sha256:6c17a57ba3c0e1601b0531c4af11b5fec6edb9c679d44790352f54374ffa7b97"],"state_sha256":"a40916e828854c7b447f66a134d6e87caeb15d73a5be4e750a95ceea50875f0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0So3tl3NGZ0//PRCuQNrNFxvJpn7UF4aeB2IsZMTznNPqX7wxZPhT9/wQ/LRXYDx0hYFniAcp2oim/fCMbUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:45:07.025641Z","bundle_sha256":"495660df42506fed384be2a39a86e04dd78184352b700b5436e8928d2aae469a"}}