{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5UBCBHWSMVNELRNLHI4TCVHIAI","short_pith_number":"pith:5UBCBHWS","canonical_record":{"source":{"id":"1604.02618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-04-09T23:16:04Z","cross_cats_sorted":["math.AC","math.AG"],"title_canon_sha256":"3ab171fd1f8fcbfd1abc0b4fcb7e1018f94bc26ea1f0bf94004b06fa569d4e06","abstract_canon_sha256":"00ddb45acf15b3f6856dd160dbd262e38da45206154312a72cad57d479bdc41b"},"schema_version":"1.0"},"canonical_sha256":"ed02209ed2655a45c5ab3a393154e802071b35cdd51d7f50a64744da920a41ef","source":{"kind":"arxiv","id":"1604.02618","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02618","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02618v2","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02618","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"5UBCBHWSMVNE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5UBCBHWSMVNELRNL","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5UBCBHWS","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5UBCBHWSMVNELRNLHI4TCVHIAI","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-04-09T23:16:04Z","cross_cats_sorted":["math.AC","math.AG"],"title_canon_sha256":"3ab171fd1f8fcbfd1abc0b4fcb7e1018f94bc26ea1f0bf94004b06fa569d4e06","abstract_canon_sha256":"00ddb45acf15b3f6856dd160dbd262e38da45206154312a72cad57d479bdc41b"},"schema_version":"1.0"},"canonical_sha256":"ed02209ed2655a45c5ab3a393154e802071b35cdd51d7f50a64744da920a41ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:52.273595Z","signature_b64":"qV7Nu7yeJbOBo8ina5OO6FQ3C1vw4o6xoQpA6SYZRchttmk10QmZVDBr1+R2J4e08Yo07OyjPJ04DuKq7k58BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed02209ed2655a45c5ab3a393154e802071b35cdd51d7f50a64744da920a41ef","last_reissued_at":"2026-05-18T00:50:52.272992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:52.272992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02618","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-18T00:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wX2gCtzHHLUCCo+M1jZPtnzkkjUDyNlqXtooIGy4u3r5EMdeF+u8zLZFSrvyZoVu+tiF15VIPpGH9WHsBaI/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:55:26.906416Z"},"content_sha256":"55fb107d6d0a71b5b57738e215251478287ebe39adf74b05046fc8ff627dcda3","schema_version":"1.0","event_id":"sha256:55fb107d6d0a71b5b57738e215251478287ebe39adf74b05046fc8ff627dcda3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5UBCBHWSMVNELRNLHI4TCVHIAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chordal networks of polynomial ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.AG"],"primary_cat":"cs.SC","authors_text":"Diego Cifuentes, Pablo A. Parrilo","submitted_at":"2016-04-09T23:16:04Z","abstract_excerpt":"We introduce a novel representation of structured polynomial ideals, which we refer to as chordal networks. The sparsity structure of a polynomial system is often described by a graph that captures the interactions among the variables. Chordal networks provide a computationally convenient decomposition into simpler (triangular) polynomial sets, while preserving the underlying graphical structure. We show that many interesting families of polynomial ideals admit compact chordal network representations (of size linear in the number of variables), even though the number of components is exponenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02618","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-18T00:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHJkuDGDwvPV15mGqXm4m3E5RgP32fi1bTW9Qd+AJNJB0Sz7rTZ2AY466rF/QIfVCh5w4sA8jj0jZoY0n7LKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:55:26.907065Z"},"content_sha256":"7d02967243751fb367c3d3cdfea6022790bf84de0dbfe6a9b382268afd344986","schema_version":"1.0","event_id":"sha256:7d02967243751fb367c3d3cdfea6022790bf84de0dbfe6a9b382268afd344986"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UBCBHWSMVNELRNLHI4TCVHIAI/bundle.json","state_url":"https://pith.science/pith/5UBCBHWSMVNELRNLHI4TCVHIAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UBCBHWSMVNELRNLHI4TCVHIAI/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-05-31T04:55:26Z","links":{"resolver":"https://pith.science/pith/5UBCBHWSMVNELRNLHI4TCVHIAI","bundle":"https://pith.science/pith/5UBCBHWSMVNELRNLHI4TCVHIAI/bundle.json","state":"https://pith.science/pith/5UBCBHWSMVNELRNLHI4TCVHIAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UBCBHWSMVNELRNLHI4TCVHIAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5UBCBHWSMVNELRNLHI4TCVHIAI","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":"00ddb45acf15b3f6856dd160dbd262e38da45206154312a72cad57d479bdc41b","cross_cats_sorted":["math.AC","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-04-09T23:16:04Z","title_canon_sha256":"3ab171fd1f8fcbfd1abc0b4fcb7e1018f94bc26ea1f0bf94004b06fa569d4e06"},"schema_version":"1.0","source":{"id":"1604.02618","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02618","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02618v2","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02618","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"5UBCBHWSMVNE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5UBCBHWSMVNELRNL","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5UBCBHWS","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:7d02967243751fb367c3d3cdfea6022790bf84de0dbfe6a9b382268afd344986","target":"graph","created_at":"2026-05-18T00:50: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":"We introduce a novel representation of structured polynomial ideals, which we refer to as chordal networks. The sparsity structure of a polynomial system is often described by a graph that captures the interactions among the variables. Chordal networks provide a computationally convenient decomposition into simpler (triangular) polynomial sets, while preserving the underlying graphical structure. We show that many interesting families of polynomial ideals admit compact chordal network representations (of size linear in the number of variables), even though the number of components is exponenti","authors_text":"Diego Cifuentes, Pablo A. Parrilo","cross_cats":["math.AC","math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-04-09T23:16:04Z","title":"Chordal networks of polynomial ideals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02618","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:55fb107d6d0a71b5b57738e215251478287ebe39adf74b05046fc8ff627dcda3","target":"record","created_at":"2026-05-18T00:50: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":"00ddb45acf15b3f6856dd160dbd262e38da45206154312a72cad57d479bdc41b","cross_cats_sorted":["math.AC","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-04-09T23:16:04Z","title_canon_sha256":"3ab171fd1f8fcbfd1abc0b4fcb7e1018f94bc26ea1f0bf94004b06fa569d4e06"},"schema_version":"1.0","source":{"id":"1604.02618","kind":"arxiv","version":2}},"canonical_sha256":"ed02209ed2655a45c5ab3a393154e802071b35cdd51d7f50a64744da920a41ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed02209ed2655a45c5ab3a393154e802071b35cdd51d7f50a64744da920a41ef","first_computed_at":"2026-05-18T00:50:52.272992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:52.272992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qV7Nu7yeJbOBo8ina5OO6FQ3C1vw4o6xoQpA6SYZRchttmk10QmZVDBr1+R2J4e08Yo07OyjPJ04DuKq7k58BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:52.273595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02618","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55fb107d6d0a71b5b57738e215251478287ebe39adf74b05046fc8ff627dcda3","sha256:7d02967243751fb367c3d3cdfea6022790bf84de0dbfe6a9b382268afd344986"],"state_sha256":"1f4f2a4b618cfde3505fd9a5d4f269f7107ddb2d05f1ed9628deab78f93b6d16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IqmL8C3PswaTgGDImvyfFQgqEoY1xaEaZx7LEeZUqt68rgQUu+lAhbRB+A5v3CrEl+NitHx/S3DlsIP+B5oZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:55:26.910110Z","bundle_sha256":"3b69cc5ada47428b87e265e654f8abf4556266a09018f451c690d7e6267c850d"}}