{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ECMND7TXTHNFDTIEJAIERUZ44X","short_pith_number":"pith:ECMND7TX","schema_version":"1.0","canonical_sha256":"2098d1fe7799da51cd04481048d33ce5e6aa1b4483364e877a51cfa99abfa92c","source":{"kind":"arxiv","id":"1810.00134","version":1},"attestation_state":"computed","paper":{"title":"A Graph Partitioning Algorithm with Application in Synthesizing Single Flux Quantum Logic Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Ghasem Pasandi, Massoud Pedram","submitted_at":"2018-09-29T02:03:01Z","abstract_excerpt":"In this paper, a new graph partitioning problem is introduced. The depth of each part is constrained, i.e., the node count in the longest path of the corresponding sub-graph is no more than a predetermined positive integer value p. An additional constraint is enforced such that each part contains only nodes selected from consecutive levels in the graph. The problem is therefore transformed into a Depth-bounded Levelized Graph Partitioning (DLGP) problem, which is solved optimally using a dynamic programming algorithm. As an example application, we have shown that DLGP can effectively generate "},"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":"1810.00134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-09-29T02:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"7d5813698c41b4659e2499734d18b0a2f87dac94ff369171b1812eace9bc6c70","abstract_canon_sha256":"21d04b071078d09b86f64ee39698316baa2b0529fce6a28a8f36ba19cd5158b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:28.687730Z","signature_b64":"RMuW2upNWs0sskEI1MZETjd35F0Qim2kpLBb/2j3rtBH5722r3xlbZh9kwQ5a81rzSwaM/bSZ3UQDdbQUtnsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2098d1fe7799da51cd04481048d33ce5e6aa1b4483364e877a51cfa99abfa92c","last_reissued_at":"2026-05-18T00:04:28.687292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:28.687292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Graph Partitioning Algorithm with Application in Synthesizing Single Flux Quantum Logic Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Ghasem Pasandi, Massoud Pedram","submitted_at":"2018-09-29T02:03:01Z","abstract_excerpt":"In this paper, a new graph partitioning problem is introduced. The depth of each part is constrained, i.e., the node count in the longest path of the corresponding sub-graph is no more than a predetermined positive integer value p. An additional constraint is enforced such that each part contains only nodes selected from consecutive levels in the graph. The problem is therefore transformed into a Depth-bounded Levelized Graph Partitioning (DLGP) problem, which is solved optimally using a dynamic programming algorithm. As an example application, we have shown that DLGP can effectively generate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00134","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":"1810.00134","created_at":"2026-05-18T00:04:28.687369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00134v1","created_at":"2026-05-18T00:04:28.687369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00134","created_at":"2026-05-18T00:04:28.687369+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECMND7TXTHNF","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECMND7TXTHNFDTIE","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECMND7TX","created_at":"2026-05-18T12:32:22.470017+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/ECMND7TXTHNFDTIEJAIERUZ44X","json":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X.json","graph_json":"https://pith.science/api/pith-number/ECMND7TXTHNFDTIEJAIERUZ44X/graph.json","events_json":"https://pith.science/api/pith-number/ECMND7TXTHNFDTIEJAIERUZ44X/events.json","paper":"https://pith.science/paper/ECMND7TX"},"agent_actions":{"view_html":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X","download_json":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X.json","view_paper":"https://pith.science/paper/ECMND7TX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00134&json=true","fetch_graph":"https://pith.science/api/pith-number/ECMND7TXTHNFDTIEJAIERUZ44X/graph.json","fetch_events":"https://pith.science/api/pith-number/ECMND7TXTHNFDTIEJAIERUZ44X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X/action/storage_attestation","attest_author":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X/action/author_attestation","sign_citation":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X/action/citation_signature","submit_replication":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X/action/replication_record"}},"created_at":"2026-05-18T00:04:28.687369+00:00","updated_at":"2026-05-18T00:04:28.687369+00:00"}