{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:IGV7SAYHTLX2MALS2Y45W5YYXZ","short_pith_number":"pith:IGV7SAYH","schema_version":"1.0","canonical_sha256":"41abf903079aefa60172d639db7718be7edb78b805039dc935505d926c3d4ef4","source":{"kind":"arxiv","id":"cs/0701032","version":4},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701032","created_at":"2026-05-18T01:37:33.390842+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0701032v4","created_at":"2026-05-18T01:37:33.390842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701032","created_at":"2026-05-18T01:37:33.390842+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGV7SAYHTLX2","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGV7SAYHTLX2MALS","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGV7SAYH","created_at":"2026-05-18T12:25:55.427421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ","json":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ.json","graph_json":"https://pith.science/api/pith-number/IGV7SAYHTLX2MALS2Y45W5YYXZ/graph.json","events_json":"https://pith.science/api/pith-number/IGV7SAYHTLX2MALS2Y45W5YYXZ/events.json","paper":"https://pith.science/paper/IGV7SAYH"},"agent_actions":{"view_html":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ","download_json":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ.json","view_paper":"https://pith.science/paper/IGV7SAYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0701032&json=true","fetch_graph":"https://pith.science/api/pith-number/IGV7SAYHTLX2MALS2Y45W5YYXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IGV7SAYHTLX2MALS2Y45W5YYXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/action/storage_attestation","attest_author":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/action/author_attestation","sign_citation":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/action/citation_signature","submit_replication":"https://pith.science/pith/IGV7SAYHTLX2MALS2Y45W5YYXZ/action/replication_record"}},"created_at":"2026-05-18T01:37:33.390842+00:00","updated_at":"2026-05-18T01:37:33.390842+00:00"}