{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ECMND7TXTHNFDTIEJAIERUZ44X","short_pith_number":"pith:ECMND7TX","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"},"canonical_sha256":"2098d1fe7799da51cd04481048d33ce5e6aa1b4483364e877a51cfa99abfa92c","source":{"kind":"arxiv","id":"1810.00134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00134","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00134v1","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00134","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"ECMND7TXTHNF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ECMND7TXTHNFDTIE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ECMND7TX","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ECMND7TXTHNFDTIEJAIERUZ44X","target":"record","payload":{"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"},"canonical_sha256":"2098d1fe7799da51cd04481048d33ce5e6aa1b4483364e877a51cfa99abfa92c","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"},"source_kind":"arxiv","source_id":"1810.00134","source_version":1,"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-18T00:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSkpNphAkHChSQ7d5l/mMLYNNSCloVm420iVb5DG9YkxdYCGUbpHz9+pzNZYuh1c3+Ggiv6oxCFlecyqcW1NCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:54:08.786810Z"},"content_sha256":"cd9e643acbb3188f9cee17c7eda920ac3075a43816075c7fb1c49d6f7804a706","schema_version":"1.0","event_id":"sha256:cd9e643acbb3188f9cee17c7eda920ac3075a43816075c7fb1c49d6f7804a706"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ECMND7TXTHNFDTIEJAIERUZ44X","target":"graph","payload":{"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"},"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-18T00:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3PcUFeyMZziNVuhGqPPRfHWX+FyZOE/D48/eB2RjySkF49+9k0S17f5dVrDRDNdkimrmjJ6uW8iAIIquqgvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:54:08.787145Z"},"content_sha256":"fbed2c18a90f52c45af1f531a2b684cf714770413114746d6ef3800943e52979","schema_version":"1.0","event_id":"sha256:fbed2c18a90f52c45af1f531a2b684cf714770413114746d6ef3800943e52979"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X/bundle.json","state_url":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECMND7TXTHNFDTIEJAIERUZ44X/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-28T14:54:08Z","links":{"resolver":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X","bundle":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X/bundle.json","state":"https://pith.science/pith/ECMND7TXTHNFDTIEJAIERUZ44X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECMND7TXTHNFDTIEJAIERUZ44X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ECMND7TXTHNFDTIEJAIERUZ44X","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":"21d04b071078d09b86f64ee39698316baa2b0529fce6a28a8f36ba19cd5158b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-09-29T02:03:01Z","title_canon_sha256":"7d5813698c41b4659e2499734d18b0a2f87dac94ff369171b1812eace9bc6c70"},"schema_version":"1.0","source":{"id":"1810.00134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00134","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00134v1","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00134","created_at":"2026-05-18T00:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"ECMND7TXTHNF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ECMND7TXTHNFDTIE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ECMND7TX","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:fbed2c18a90f52c45af1f531a2b684cf714770413114746d6ef3800943e52979","target":"graph","created_at":"2026-05-18T00:04:28Z","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":"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 ","authors_text":"Ghasem Pasandi, Massoud Pedram","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-09-29T02:03:01Z","title":"A Graph Partitioning Algorithm with Application in Synthesizing Single Flux Quantum Logic Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00134","kind":"arxiv","version":1},"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:cd9e643acbb3188f9cee17c7eda920ac3075a43816075c7fb1c49d6f7804a706","target":"record","created_at":"2026-05-18T00:04:28Z","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":"21d04b071078d09b86f64ee39698316baa2b0529fce6a28a8f36ba19cd5158b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-09-29T02:03:01Z","title_canon_sha256":"7d5813698c41b4659e2499734d18b0a2f87dac94ff369171b1812eace9bc6c70"},"schema_version":"1.0","source":{"id":"1810.00134","kind":"arxiv","version":1}},"canonical_sha256":"2098d1fe7799da51cd04481048d33ce5e6aa1b4483364e877a51cfa99abfa92c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2098d1fe7799da51cd04481048d33ce5e6aa1b4483364e877a51cfa99abfa92c","first_computed_at":"2026-05-18T00:04:28.687292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:28.687292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RMuW2upNWs0sskEI1MZETjd35F0Qim2kpLBb/2j3rtBH5722r3xlbZh9kwQ5a81rzSwaM/bSZ3UQDdbQUtnsDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:28.687730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd9e643acbb3188f9cee17c7eda920ac3075a43816075c7fb1c49d6f7804a706","sha256:fbed2c18a90f52c45af1f531a2b684cf714770413114746d6ef3800943e52979"],"state_sha256":"3f05fada2871daa5f3288a4248fd9697ebef75319d095e8d19e4939e20d1444f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtU9rpY1hLgN4gKEaUxhC3PYyImOd2CZ0ziRLds3MLTYweCeZoONVIkDdP+Diebnp/5oFJr2UfKTAEE4HwqjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:54:08.789067Z","bundle_sha256":"6eeeed7514c82d358abe624c9194b6eb06c60d0de8b5ca8f4ded13f88423cfee"}}