{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UPGM3NX2H2DRAECLORN34XW3KH","short_pith_number":"pith:UPGM3NX2","schema_version":"1.0","canonical_sha256":"a3cccdb6fa3e8710104b745bbe5edb51c292982f6e28c6a41977d8c72ffe5a26","source":{"kind":"arxiv","id":"1508.03931","version":1},"attestation_state":"computed","paper":{"title":"Knuthian Drawings of Series-Parallel Flowcharts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Manuel Torres, Michael T. Goodrich, Timothy Johnson","submitted_at":"2015-08-17T05:59:27Z","abstract_excerpt":"Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loop-free algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of edge bends."},"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":"1508.03931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-08-17T05:59:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7b908a290c608193f1c6506eeca1c09e82de56769381efdf244c5bfa915adf94","abstract_canon_sha256":"894782155ca9183798d1dcacc20413028e2b90e4004818032b560078bc6cfc78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:14.856651Z","signature_b64":"dSpBgvAv7XFdNQhG7ILZHoBicXLPmqhJM9fw4ZCKOb0QOfqhrxdY2bXN0zagyLmf71RAkecCgeAs//u9Kw0ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3cccdb6fa3e8710104b745bbe5edb51c292982f6e28c6a41977d8c72ffe5a26","last_reissued_at":"2026-05-18T01:35:14.856197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:14.856197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knuthian Drawings of Series-Parallel Flowcharts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Manuel Torres, Michael T. Goodrich, Timothy Johnson","submitted_at":"2015-08-17T05:59:27Z","abstract_excerpt":"Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loop-free algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of edge bends."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03931","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.03931","created_at":"2026-05-18T01:35:14.856290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03931v1","created_at":"2026-05-18T01:35:14.856290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03931","created_at":"2026-05-18T01:35:14.856290+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPGM3NX2H2DR","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPGM3NX2H2DRAECL","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPGM3NX2","created_at":"2026-05-18T12:29:44.643036+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/UPGM3NX2H2DRAECLORN34XW3KH","json":"https://pith.science/pith/UPGM3NX2H2DRAECLORN34XW3KH.json","graph_json":"https://pith.science/api/pith-number/UPGM3NX2H2DRAECLORN34XW3KH/graph.json","events_json":"https://pith.science/api/pith-number/UPGM3NX2H2DRAECLORN34XW3KH/events.json","paper":"https://pith.science/paper/UPGM3NX2"},"agent_actions":{"view_html":"https://pith.science/pith/UPGM3NX2H2DRAECLORN34XW3KH","download_json":"https://pith.science/pith/UPGM3NX2H2DRAECLORN34XW3KH.json","view_paper":"https://pith.science/paper/UPGM3NX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03931&json=true","fetch_graph":"https://pith.science/api/pith-number/UPGM3NX2H2DRAECLORN34XW3KH/graph.json","fetch_events":"https://pith.science/api/pith-number/UPGM3NX2H2DRAECLORN34XW3KH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPGM3NX2H2DRAECLORN34XW3KH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPGM3NX2H2DRAECLORN34XW3KH/action/storage_attestation","attest_author":"https://pith.science/pith/UPGM3NX2H2DRAECLORN34XW3KH/action/author_attestation","sign_citation":"https://pith.science/pith/UPGM3NX2H2DRAECLORN34XW3KH/action/citation_signature","submit_replication":"https://pith.science/pith/UPGM3NX2H2DRAECLORN34XW3KH/action/replication_record"}},"created_at":"2026-05-18T01:35:14.856290+00:00","updated_at":"2026-05-18T01:35:14.856290+00:00"}