{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:IGV7SAYHTLX2MALS2Y45W5YYXZ","short_pith_number":"pith:IGV7SAYH","canonical_record":{"source":{"id":"cs/0701032","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2007-01-05T18:05:48Z","cross_cats_sorted":["cs.CC","math.CT"],"title_canon_sha256":"fb902f97ef2c36c288a24508dfb30dc77adf76633d9df306e9722998cbe3470f","abstract_canon_sha256":"872184a942e1eb87a6d044baf934411dc01961ce3428e0d0d86fbbf7e5e4f3a9"},"schema_version":"1.0"},"canonical_sha256":"41abf903079aefa60172d639db7718be7edb78b805039dc935505d926c3d4ef4","source":{"kind":"arxiv","id":"cs/0701032","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701032","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701032v4","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701032","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"IGV7SAYHTLX2","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"IGV7SAYHTLX2MALS","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"IGV7SAYH","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:IGV7SAYHTLX2MALS2Y45W5YYXZ","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0701032","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2007-01-05T18:05:48Z","cross_cats_sorted":["cs.CC","math.CT"],"title_canon_sha256":"fb902f97ef2c36c288a24508dfb30dc77adf76633d9df306e9722998cbe3470f","abstract_canon_sha256":"872184a942e1eb87a6d044baf934411dc01961ce3428e0d0d86fbbf7e5e4f3a9"},"schema_version":"1.0"},"canonical_sha256":"41abf903079aefa60172d639db7718be7edb78b805039dc935505d926c3d4ef4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:33.391417Z","signature_b64":"k6Hkc+yP5XPO7JAZVc/0C1HF3/Ta5i+NLeJTwQYfq6tZaZrZMJGv6naXmalIkema+8Iu9kmQqBQsDPM1+MWDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41abf903079aefa60172d639db7718be7edb78b805039dc935505d926c3d4ef4","last_reissued_at":"2026-05-18T01:37:33.390742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:33.390742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0701032","source_version":4,"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:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agIZN8/E76j/W0bFauG0O/F4GIaH49c0xxAWTJWv5Q5oqfbJ2+SDNo64P/Es6WohcO61RB9e37yKhoIUVKs3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:47:18.930199Z"},"content_sha256":"d949163163b08ef11e9ffd13818f6ec9d901821a1a1abd04b5c7a237082c2b8c","schema_version":"1.0","event_id":"sha256:d949163163b08ef11e9ffd13818f6ec9d901821a1a1abd04b5c7a237082c2b8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:IGV7SAYHTLX2MALS2Y45W5YYXZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polygraphic programs and polynomial-time functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CT"],"primary_cat":"cs.LO","authors_text":"Guillaume Bonfante, Yves Guiraud","submitted_at":"2007-01-05T18:05:48Z","abstract_excerpt":"We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a Turing-complete computational model. Their algebraic structure is used by analysis tools, called polygraphic interpretations, for complexity analysis. In particular, we delineate a subclass of polygraphic programs that compute exactly the functions that are Turing-computable in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701032","kind":"arxiv","version":4},"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:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSLrXrXsWM+Z3UNBGcrpE8svYDtf6RVnFR0Hnj9qXso9juFYjhSZw/AxeRO6T5z4PEeCAx2uy8okAuokYbEHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:47:18.930848Z"},"content_sha256":"857946dbe61b1cfd62688e870d20082411ad1f9e0910c90759a1b28e2bc1f780","schema_version":"1.0","event_id":"sha256:857946dbe61b1cfd62688e870d20082411ad1f9e0910c90759a1b28e2bc1f780"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/bundle.json","state_url":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/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-31T01:47:18Z","links":{"resolver":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ","bundle":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/bundle.json","state":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:IGV7SAYHTLX2MALS2Y45W5YYXZ","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":"872184a942e1eb87a6d044baf934411dc01961ce3428e0d0d86fbbf7e5e4f3a9","cross_cats_sorted":["cs.CC","math.CT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2007-01-05T18:05:48Z","title_canon_sha256":"fb902f97ef2c36c288a24508dfb30dc77adf76633d9df306e9722998cbe3470f"},"schema_version":"1.0","source":{"id":"cs/0701032","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701032","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701032v4","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701032","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"IGV7SAYHTLX2","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"IGV7SAYHTLX2MALS","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"IGV7SAYH","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:857946dbe61b1cfd62688e870d20082411ad1f9e0910c90759a1b28e2bc1f780","target":"graph","created_at":"2026-05-18T01:37:33Z","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 study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a Turing-complete computational model. Their algebraic structure is used by analysis tools, called polygraphic interpretations, for complexity analysis. In particular, we delineate a subclass of polygraphic programs that compute exactly the functions that are Turing-computable in polynomial time.","authors_text":"Guillaume Bonfante, Yves Guiraud","cross_cats":["cs.CC","math.CT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2007-01-05T18:05:48Z","title":"Polygraphic programs and polynomial-time functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701032","kind":"arxiv","version":4},"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:d949163163b08ef11e9ffd13818f6ec9d901821a1a1abd04b5c7a237082c2b8c","target":"record","created_at":"2026-05-18T01:37:33Z","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":"872184a942e1eb87a6d044baf934411dc01961ce3428e0d0d86fbbf7e5e4f3a9","cross_cats_sorted":["cs.CC","math.CT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2007-01-05T18:05:48Z","title_canon_sha256":"fb902f97ef2c36c288a24508dfb30dc77adf76633d9df306e9722998cbe3470f"},"schema_version":"1.0","source":{"id":"cs/0701032","kind":"arxiv","version":4}},"canonical_sha256":"41abf903079aefa60172d639db7718be7edb78b805039dc935505d926c3d4ef4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41abf903079aefa60172d639db7718be7edb78b805039dc935505d926c3d4ef4","first_computed_at":"2026-05-18T01:37:33.390742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:33.390742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k6Hkc+yP5XPO7JAZVc/0C1HF3/Ta5i+NLeJTwQYfq6tZaZrZMJGv6naXmalIkema+8Iu9kmQqBQsDPM1+MWDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:33.391417Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0701032","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d949163163b08ef11e9ffd13818f6ec9d901821a1a1abd04b5c7a237082c2b8c","sha256:857946dbe61b1cfd62688e870d20082411ad1f9e0910c90759a1b28e2bc1f780"],"state_sha256":"761ae2468337b9ca71af84ef95afe22498e86b9b21aec04eda156e24a96a4df0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6F3hz8/FIrw6Zavi+5TuONEqA+55+mmPsjPY6SSh2YuaH+QU2wvIf/32xdT5CjOufpkPyCaycUMLqqyvA6wlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:47:18.935699Z","bundle_sha256":"def6796290c0ba61a19c8ab5899a8e124a3b9762ddb351e51a781ff5980b72c4"}}