{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:5JVCBVTOGRBPLXTLUG53QZZZXW","short_pith_number":"pith:5JVCBVTO","canonical_record":{"source":{"id":"0705.3751","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:34:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"33362147ce24e0e04d6a57d76dc53f73bb9730c19c992a502c9ba0deded4a8a6","abstract_canon_sha256":"a0a0205fb96871c2c72b13252d1ffcd877914f1ecb6675444ef42523306eaa20"},"schema_version":"1.0"},"canonical_sha256":"ea6a20d66e3442f5de6ba1bbb86739bd87916b6b6687591945138c975841fa0b","source":{"kind":"arxiv","id":"0705.3751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.3751","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"0705.3751v1","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.3751","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"5JVCBVTOGRBP","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"pith_short_16","alias_value":"5JVCBVTOGRBPLXTL","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"pith_short_8","alias_value":"5JVCBVTO","created_at":"2026-07-04T15:02:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:5JVCBVTOGRBPLXTLUG53QZZZXW","target":"record","payload":{"canonical_record":{"source":{"id":"0705.3751","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:34:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"33362147ce24e0e04d6a57d76dc53f73bb9730c19c992a502c9ba0deded4a8a6","abstract_canon_sha256":"a0a0205fb96871c2c72b13252d1ffcd877914f1ecb6675444ef42523306eaa20"},"schema_version":"1.0"},"canonical_sha256":"ea6a20d66e3442f5de6ba1bbb86739bd87916b6b6687591945138c975841fa0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:10.685462Z","signature_b64":"FdkIne7zo6PLjQZXF7Dd0NjI6Va8iYa4Ckg5PzvQcbRJZkTxFjp2jisP++DuLUepp+Ew56YU3vvQF//XVLKjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea6a20d66e3442f5de6ba1bbb86739bd87916b6b6687591945138c975841fa0b","last_reissued_at":"2026-07-04T15:02:10.685047Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:10.685047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0705.3751","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-07-04T15:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HdzPBenwRFfMblubWrMD6NexuzxkYptaimLO0v44bp4OKJCGdgKQ7skasiLguLkfG8U2kMDJLV3QE4KQxcaRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:33:28.972337Z"},"content_sha256":"e7ea1398cd18bb0b16e52782a86dfca62c92eae58bc2ffbde08cd43995d1058c","schema_version":"1.0","event_id":"sha256:e7ea1398cd18bb0b16e52782a86dfca62c92eae58bc2ffbde08cd43995d1058c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:5JVCBVTOGRBPLXTLUG53QZZZXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the expressive power of planar perfect matching and permanents of bounded treewidth matrices","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Laurent Lyaudet (LIP), Pascal Koiran (LIP), Uffe Flarup (IMADA)","submitted_at":"2007-05-25T11:34:13Z","abstract_excerpt":"Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and NP. They are defined using non-uniform sequences of arithmetic circuits and provides a framework to study the complexity for sequences of polynomials. Prominent examples of difficult (that is, VNP-complete) problems in this model includes the permanent and hamiltonian polynomials. While the permanent and hamiltonian polynomials in general are difficult to evaluate, there have been research on which special cases of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.3751","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0705.3751/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/rcaQW+2E74NkP+bRMEE84YOJHttTN/pW01kbSNZLKqYMxc8kTah5YSdUH1610r3DtVw9+z8O+bybD8qiiFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:33:28.972744Z"},"content_sha256":"69c3617ee051bf1c41229eb55ae3ecfdc6c875b9dad6edaf596d2d37c5ad4c71","schema_version":"1.0","event_id":"sha256:69c3617ee051bf1c41229eb55ae3ecfdc6c875b9dad6edaf596d2d37c5ad4c71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JVCBVTOGRBPLXTLUG53QZZZXW/bundle.json","state_url":"https://pith.science/pith/5JVCBVTOGRBPLXTLUG53QZZZXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JVCBVTOGRBPLXTLUG53QZZZXW/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-07-04T19:33:28Z","links":{"resolver":"https://pith.science/pith/5JVCBVTOGRBPLXTLUG53QZZZXW","bundle":"https://pith.science/pith/5JVCBVTOGRBPLXTLUG53QZZZXW/bundle.json","state":"https://pith.science/pith/5JVCBVTOGRBPLXTLUG53QZZZXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JVCBVTOGRBPLXTLUG53QZZZXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:5JVCBVTOGRBPLXTLUG53QZZZXW","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":"a0a0205fb96871c2c72b13252d1ffcd877914f1ecb6675444ef42523306eaa20","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:34:13Z","title_canon_sha256":"33362147ce24e0e04d6a57d76dc53f73bb9730c19c992a502c9ba0deded4a8a6"},"schema_version":"1.0","source":{"id":"0705.3751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.3751","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"0705.3751v1","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.3751","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"5JVCBVTOGRBP","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"pith_short_16","alias_value":"5JVCBVTOGRBPLXTL","created_at":"2026-07-04T15:02:10Z"},{"alias_kind":"pith_short_8","alias_value":"5JVCBVTO","created_at":"2026-07-04T15:02:10Z"}],"graph_snapshots":[{"event_id":"sha256:69c3617ee051bf1c41229eb55ae3ecfdc6c875b9dad6edaf596d2d37c5ad4c71","target":"graph","created_at":"2026-07-04T15:02:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0705.3751/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and NP. They are defined using non-uniform sequences of arithmetic circuits and provides a framework to study the complexity for sequences of polynomials. Prominent examples of difficult (that is, VNP-complete) problems in this model includes the permanent and hamiltonian polynomials. While the permanent and hamiltonian polynomials in general are difficult to evaluate, there have been research on which special cases of ","authors_text":"Laurent Lyaudet (LIP), Pascal Koiran (LIP), Uffe Flarup (IMADA)","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:34:13Z","title":"On the expressive power of planar perfect matching and permanents of bounded treewidth matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.3751","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:e7ea1398cd18bb0b16e52782a86dfca62c92eae58bc2ffbde08cd43995d1058c","target":"record","created_at":"2026-07-04T15:02:10Z","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":"a0a0205fb96871c2c72b13252d1ffcd877914f1ecb6675444ef42523306eaa20","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:34:13Z","title_canon_sha256":"33362147ce24e0e04d6a57d76dc53f73bb9730c19c992a502c9ba0deded4a8a6"},"schema_version":"1.0","source":{"id":"0705.3751","kind":"arxiv","version":1}},"canonical_sha256":"ea6a20d66e3442f5de6ba1bbb86739bd87916b6b6687591945138c975841fa0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea6a20d66e3442f5de6ba1bbb86739bd87916b6b6687591945138c975841fa0b","first_computed_at":"2026-07-04T15:02:10.685047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:10.685047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FdkIne7zo6PLjQZXF7Dd0NjI6Va8iYa4Ckg5PzvQcbRJZkTxFjp2jisP++DuLUepp+Ew56YU3vvQF//XVLKjDQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:10.685462Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.3751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7ea1398cd18bb0b16e52782a86dfca62c92eae58bc2ffbde08cd43995d1058c","sha256:69c3617ee051bf1c41229eb55ae3ecfdc6c875b9dad6edaf596d2d37c5ad4c71"],"state_sha256":"6bd472dea8826cee93518ad656a1845d16fc12b4c97fdd7c47c1042f3bb00939"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCV407RUmTcJhxgpXZoJS54l0TCbIyptxrYQ1+G0W6IktS42GeGRdRhEIiic/3mXkhwMdExUKHCgXg69BmvTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T19:33:28.974720Z","bundle_sha256":"7308725b822e3dc91c8012d2cb3766f2ab2bf66e0aba14bd15db67aab6eade67"}}