{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZY737SK5W5BZNPXEYJFAV6WDUI","short_pith_number":"pith:ZY737SK5","canonical_record":{"source":{"id":"1606.08141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-27T07:02:18Z","cross_cats_sorted":[],"title_canon_sha256":"6402be6ca2819411f59486f221023365809461946759f35797bb0c8c9d85b969","abstract_canon_sha256":"0d561da23bf0ab213a80e43029c4e801e0b24079780cb79b4e5c20dcd2234671"},"schema_version":"1.0"},"canonical_sha256":"ce3fbfc95db74396bee4c24a0afac3a215c28065d0149e6fa8a3f6b962fe9e57","source":{"kind":"arxiv","id":"1606.08141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08141","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08141v1","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08141","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZY737SK5W5BZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZY737SK5W5BZNPXE","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZY737SK5","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZY737SK5W5BZNPXEYJFAV6WDUI","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-27T07:02:18Z","cross_cats_sorted":[],"title_canon_sha256":"6402be6ca2819411f59486f221023365809461946759f35797bb0c8c9d85b969","abstract_canon_sha256":"0d561da23bf0ab213a80e43029c4e801e0b24079780cb79b4e5c20dcd2234671"},"schema_version":"1.0"},"canonical_sha256":"ce3fbfc95db74396bee4c24a0afac3a215c28065d0149e6fa8a3f6b962fe9e57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:52.679274Z","signature_b64":"d4Io/r4Mscz4MymjB11i4flwoYpRtYMPTbsOeIlPpfxOJmb/EvTA1do+OwWBxZH7IDyWqj79LbtW1vt3FP5HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce3fbfc95db74396bee4c24a0afac3a215c28065d0149e6fa8a3f6b962fe9e57","last_reissued_at":"2026-05-18T01:11:52.678656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:52.678656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08141","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-18T01:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sY1A/R1Pr0l+OAwdhML/GAk3PknqkUz1Kjy+y/uE6dJSJ0Jz+Q3jvUJFuTVVP4senICYcXaLg4xnlRP6zUj9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:16:34.304192Z"},"content_sha256":"ac873fa241df23f7075895ffa91bc61a2018e877793821c1d692a3d863d87087","schema_version":"1.0","event_id":"sha256:ac873fa241df23f7075895ffa91bc61a2018e877793821c1d692a3d863d87087"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZY737SK5W5BZNPXEYJFAV6WDUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"R. B. Sandeep, Yixin Cao","submitted_at":"2016-06-27T07:02:18Z","abstract_excerpt":"Given an $n*n$ sparse symmetric matrix with $m$ nonzero entries, performing Gaussian elimination may turn some zeroes into nonzero values. To maintain the matrix sparse, we would like to minimize the number $k$ of these changes, hence called the minimum fill-in problem. Agrawal et al.~[FOCS'90] developed the first approximation algorithm, based on early heuristics by George [SIAM J Numer Anal 10] and by Lipton et al.~[SIAM J Numer Anal 16]. The objective function they used is $m+k$, the number of nonzero elements after elimination. An approximation algorithm using $k$ as the objective function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08141","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-18T01:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwiyGfMU0y+AkYO2r6T2R79x1Ink9wBGJ0QNPsM2VlErpyg7Vro/pzvuqGy/WBAi9gaGlFgDgsjlo2V+5f35Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:16:34.304561Z"},"content_sha256":"4f2e7a6c09422b4173f434cc78eb90fd838034d831f219cb52a321d257bc5796","schema_version":"1.0","event_id":"sha256:4f2e7a6c09422b4173f434cc78eb90fd838034d831f219cb52a321d257bc5796"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZY737SK5W5BZNPXEYJFAV6WDUI/bundle.json","state_url":"https://pith.science/pith/ZY737SK5W5BZNPXEYJFAV6WDUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZY737SK5W5BZNPXEYJFAV6WDUI/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-02T16:16:34Z","links":{"resolver":"https://pith.science/pith/ZY737SK5W5BZNPXEYJFAV6WDUI","bundle":"https://pith.science/pith/ZY737SK5W5BZNPXEYJFAV6WDUI/bundle.json","state":"https://pith.science/pith/ZY737SK5W5BZNPXEYJFAV6WDUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZY737SK5W5BZNPXEYJFAV6WDUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZY737SK5W5BZNPXEYJFAV6WDUI","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":"0d561da23bf0ab213a80e43029c4e801e0b24079780cb79b4e5c20dcd2234671","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-27T07:02:18Z","title_canon_sha256":"6402be6ca2819411f59486f221023365809461946759f35797bb0c8c9d85b969"},"schema_version":"1.0","source":{"id":"1606.08141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08141","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08141v1","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08141","created_at":"2026-05-18T01:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZY737SK5W5BZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZY737SK5W5BZNPXE","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZY737SK5","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:4f2e7a6c09422b4173f434cc78eb90fd838034d831f219cb52a321d257bc5796","target":"graph","created_at":"2026-05-18T01:11:52Z","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":"Given an $n*n$ sparse symmetric matrix with $m$ nonzero entries, performing Gaussian elimination may turn some zeroes into nonzero values. To maintain the matrix sparse, we would like to minimize the number $k$ of these changes, hence called the minimum fill-in problem. Agrawal et al.~[FOCS'90] developed the first approximation algorithm, based on early heuristics by George [SIAM J Numer Anal 10] and by Lipton et al.~[SIAM J Numer Anal 16]. The objective function they used is $m+k$, the number of nonzero elements after elimination. An approximation algorithm using $k$ as the objective function","authors_text":"R. B. Sandeep, Yixin Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-27T07:02:18Z","title":"Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08141","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:ac873fa241df23f7075895ffa91bc61a2018e877793821c1d692a3d863d87087","target":"record","created_at":"2026-05-18T01:11:52Z","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":"0d561da23bf0ab213a80e43029c4e801e0b24079780cb79b4e5c20dcd2234671","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-27T07:02:18Z","title_canon_sha256":"6402be6ca2819411f59486f221023365809461946759f35797bb0c8c9d85b969"},"schema_version":"1.0","source":{"id":"1606.08141","kind":"arxiv","version":1}},"canonical_sha256":"ce3fbfc95db74396bee4c24a0afac3a215c28065d0149e6fa8a3f6b962fe9e57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce3fbfc95db74396bee4c24a0afac3a215c28065d0149e6fa8a3f6b962fe9e57","first_computed_at":"2026-05-18T01:11:52.678656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:52.678656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d4Io/r4Mscz4MymjB11i4flwoYpRtYMPTbsOeIlPpfxOJmb/EvTA1do+OwWBxZH7IDyWqj79LbtW1vt3FP5HDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:52.679274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac873fa241df23f7075895ffa91bc61a2018e877793821c1d692a3d863d87087","sha256:4f2e7a6c09422b4173f434cc78eb90fd838034d831f219cb52a321d257bc5796"],"state_sha256":"542f6df0c49d78bbef0e261ff64a66d0d3d13701d4ff06d0fd351c3400509373"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kO4ynZ6A4tP0CMEwZqM3viQpCeDwVDKun4BCykdXECFWl4e5/pwpYBr3s7EGKstS96xcLl1VGpq1+0XoebraAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:16:34.306463Z","bundle_sha256":"ab101e70688ac2fbedf4f7af7e6f23d21dce020b939da078a2ad74cda4356cc9"}}