{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZT4A26ERDI7BWVF3E3KRPBENTC","short_pith_number":"pith:ZT4A26ER","schema_version":"1.0","canonical_sha256":"ccf80d78911a3e1b54bb26d517848d9898b7ea9115231654b571c5084342df6c","source":{"kind":"arxiv","id":"1603.05775","version":1},"attestation_state":"computed","paper":{"title":"Multiprocessor Scheduling of a Multi-mode Dataflow Graph Considering Mode Transition Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Hanwoong Jung, Hyunok Oh, Soonhoi Ha","submitted_at":"2016-03-18T06:16:17Z","abstract_excerpt":"Synchronous Data Flow (SDF) model is widely used for specifying signal processing or streaming applications. Since modern embedded applications become more complex with dynamic behavior changes at run-time, several extensions of the SDF model have been proposed to specify the dynamic behavior changes while preserving static analyzability of the SDF model. They assume that an application has a finite number of behaviors (or modes) and each behavior (mode) is represented by an SDF graph. They are classified as multi-mode dataflow models in this paper. While there exist several scheduling techniq"},"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":"1603.05775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2016-03-18T06:16:17Z","cross_cats_sorted":[],"title_canon_sha256":"feac57fe2e7843c395a98a2dd00204b2e8582b26f37315b6295904f7f7531965","abstract_canon_sha256":"3833bb5bf65912e78a742d8b181fdccbd49db0e4ad02d33fe6e510215535b88a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:31.462081Z","signature_b64":"TsZKtla9IvR1BZl+dyse+M3coW5bXEU8pJSNP6ClexCX6DlQAViaaB66gVfoADiQ48v0eQ92SeLCbtglzGJ1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccf80d78911a3e1b54bb26d517848d9898b7ea9115231654b571c5084342df6c","last_reissued_at":"2026-05-18T00:32:31.461417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:31.461417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiprocessor Scheduling of a Multi-mode Dataflow Graph Considering Mode Transition Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"Hanwoong Jung, Hyunok Oh, Soonhoi Ha","submitted_at":"2016-03-18T06:16:17Z","abstract_excerpt":"Synchronous Data Flow (SDF) model is widely used for specifying signal processing or streaming applications. Since modern embedded applications become more complex with dynamic behavior changes at run-time, several extensions of the SDF model have been proposed to specify the dynamic behavior changes while preserving static analyzability of the SDF model. They assume that an application has a finite number of behaviors (or modes) and each behavior (mode) is represented by an SDF graph. They are classified as multi-mode dataflow models in this paper. While there exist several scheduling techniq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05775","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":"1603.05775","created_at":"2026-05-18T00:32:31.461551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05775v1","created_at":"2026-05-18T00:32:31.461551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05775","created_at":"2026-05-18T00:32:31.461551+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZT4A26ERDI7B","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZT4A26ERDI7BWVF3","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZT4A26ER","created_at":"2026-05-18T12:30:55.937587+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/ZT4A26ERDI7BWVF3E3KRPBENTC","json":"https://pith.science/pith/ZT4A26ERDI7BWVF3E3KRPBENTC.json","graph_json":"https://pith.science/api/pith-number/ZT4A26ERDI7BWVF3E3KRPBENTC/graph.json","events_json":"https://pith.science/api/pith-number/ZT4A26ERDI7BWVF3E3KRPBENTC/events.json","paper":"https://pith.science/paper/ZT4A26ER"},"agent_actions":{"view_html":"https://pith.science/pith/ZT4A26ERDI7BWVF3E3KRPBENTC","download_json":"https://pith.science/pith/ZT4A26ERDI7BWVF3E3KRPBENTC.json","view_paper":"https://pith.science/paper/ZT4A26ER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05775&json=true","fetch_graph":"https://pith.science/api/pith-number/ZT4A26ERDI7BWVF3E3KRPBENTC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZT4A26ERDI7BWVF3E3KRPBENTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZT4A26ERDI7BWVF3E3KRPBENTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZT4A26ERDI7BWVF3E3KRPBENTC/action/storage_attestation","attest_author":"https://pith.science/pith/ZT4A26ERDI7BWVF3E3KRPBENTC/action/author_attestation","sign_citation":"https://pith.science/pith/ZT4A26ERDI7BWVF3E3KRPBENTC/action/citation_signature","submit_replication":"https://pith.science/pith/ZT4A26ERDI7BWVF3E3KRPBENTC/action/replication_record"}},"created_at":"2026-05-18T00:32:31.461551+00:00","updated_at":"2026-05-18T00:32:31.461551+00:00"}