{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GHIQHOT2O7NFDGKZ4SHSE624CN","short_pith_number":"pith:GHIQHOT2","schema_version":"1.0","canonical_sha256":"31d103ba7a77da519959e48f227b5c135d20893eeddf668307ddb3b99137b93f","source":{"kind":"arxiv","id":"1708.09597","version":1},"attestation_state":"computed","paper":{"title":"Advanced Datapath Synthesis using Graph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Andrew Sullivan, Cunxi Yu, Maciej Ciesielski, Mihir Choudhury","submitted_at":"2017-08-31T07:34:00Z","abstract_excerpt":"This paper presents an advanced DAG-based algorithm for datapath synthesis that targets area minimization using logic-level resource sharing. The problem of identifying common specification logic is formulated using unweighted graph isomorphism problem, in contrast to a weighted graph isomorphism using AIGs. In the context of gate-level datapath circuits, our algorithm solves the un- weighted graph isomorphism problem in linear time. The experiments are conducted within an industrial synthesis flow that includes the complete high-level synthesis, logic synthesis and placement and route procedu"},"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":"1708.09597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-08-31T07:34:00Z","cross_cats_sorted":[],"title_canon_sha256":"d424d5235129891927652fdf148a82a59c60bb4d1a769dce6a2c77896c2122e7","abstract_canon_sha256":"6cebd225edc9a2c5b0d5bb7ade4d3d88bc759ac09b43fe0c1075b8315f234b8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:16.004880Z","signature_b64":"0BaG35VSTG5J2s1TZhuK8tRTW+K/FSF8dNqLifqTtLu0N4IVXn/BtubLVdT01RUsigpqYBN6YE14EphQ+RMECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31d103ba7a77da519959e48f227b5c135d20893eeddf668307ddb3b99137b93f","last_reissued_at":"2026-05-18T00:36:16.004191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:16.004191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advanced Datapath Synthesis using Graph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Andrew Sullivan, Cunxi Yu, Maciej Ciesielski, Mihir Choudhury","submitted_at":"2017-08-31T07:34:00Z","abstract_excerpt":"This paper presents an advanced DAG-based algorithm for datapath synthesis that targets area minimization using logic-level resource sharing. The problem of identifying common specification logic is formulated using unweighted graph isomorphism problem, in contrast to a weighted graph isomorphism using AIGs. In the context of gate-level datapath circuits, our algorithm solves the un- weighted graph isomorphism problem in linear time. The experiments are conducted within an industrial synthesis flow that includes the complete high-level synthesis, logic synthesis and placement and route procedu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09597","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":"1708.09597","created_at":"2026-05-18T00:36:16.004291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09597v1","created_at":"2026-05-18T00:36:16.004291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09597","created_at":"2026-05-18T00:36:16.004291+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHIQHOT2O7NF","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHIQHOT2O7NFDGKZ","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHIQHOT2","created_at":"2026-05-18T12:31:18.294218+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/GHIQHOT2O7NFDGKZ4SHSE624CN","json":"https://pith.science/pith/GHIQHOT2O7NFDGKZ4SHSE624CN.json","graph_json":"https://pith.science/api/pith-number/GHIQHOT2O7NFDGKZ4SHSE624CN/graph.json","events_json":"https://pith.science/api/pith-number/GHIQHOT2O7NFDGKZ4SHSE624CN/events.json","paper":"https://pith.science/paper/GHIQHOT2"},"agent_actions":{"view_html":"https://pith.science/pith/GHIQHOT2O7NFDGKZ4SHSE624CN","download_json":"https://pith.science/pith/GHIQHOT2O7NFDGKZ4SHSE624CN.json","view_paper":"https://pith.science/paper/GHIQHOT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09597&json=true","fetch_graph":"https://pith.science/api/pith-number/GHIQHOT2O7NFDGKZ4SHSE624CN/graph.json","fetch_events":"https://pith.science/api/pith-number/GHIQHOT2O7NFDGKZ4SHSE624CN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHIQHOT2O7NFDGKZ4SHSE624CN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHIQHOT2O7NFDGKZ4SHSE624CN/action/storage_attestation","attest_author":"https://pith.science/pith/GHIQHOT2O7NFDGKZ4SHSE624CN/action/author_attestation","sign_citation":"https://pith.science/pith/GHIQHOT2O7NFDGKZ4SHSE624CN/action/citation_signature","submit_replication":"https://pith.science/pith/GHIQHOT2O7NFDGKZ4SHSE624CN/action/replication_record"}},"created_at":"2026-05-18T00:36:16.004291+00:00","updated_at":"2026-05-18T00:36:16.004291+00:00"}