{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G4VBFJYCOLUCK65YUFMHMRPWOX","short_pith_number":"pith:G4VBFJYC","schema_version":"1.0","canonical_sha256":"372a12a70272e8257bb8a1587645f675d357fd1099448583741cf15d7a322f8e","source":{"kind":"arxiv","id":"1503.03974","version":3},"attestation_state":"computed","paper":{"title":"Hyper Temporal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Carlo Comin, Roberto Posenato, Romeo Rizzi","submitted_at":"2015-03-13T07:44:19Z","abstract_excerpt":"Simple Temporal Networks (STNs) provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables. In this paper we introduce Hyper Temporal Networks (HyTNs), a strict generalization of STNs, to overcome the limitation of considering only conjunctions of constraints but maintaining a practical efficiency in the consistency check of the instances. In a Hyper Temporal Network a single temporal hyperarc constraint may be defined as a set of two or more maximum delay constraints which is satisfied when at least one of these dela"},"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":"1503.03974","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-13T07:44:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"048909668572fe5d98ac96d138cf97a1d983e91f2964dc83d1201a6029aa9291","abstract_canon_sha256":"fdb5ec0593173376d16a8a2d27c6061c810aee67401888b6a1883eb26be401af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:10.148102Z","signature_b64":"soI9JIN0I8MCaw61lXgCL5sOMyNM/pVkbHKDiLhttkvQpxNE8WzvN7KZz6sU/oQUYHe2kFwLn2pdLXxi3yDNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"372a12a70272e8257bb8a1587645f675d357fd1099448583741cf15d7a322f8e","last_reissued_at":"2026-05-18T00:48:10.147531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:10.147531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyper Temporal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Carlo Comin, Roberto Posenato, Romeo Rizzi","submitted_at":"2015-03-13T07:44:19Z","abstract_excerpt":"Simple Temporal Networks (STNs) provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables. In this paper we introduce Hyper Temporal Networks (HyTNs), a strict generalization of STNs, to overcome the limitation of considering only conjunctions of constraints but maintaining a practical efficiency in the consistency check of the instances. In a Hyper Temporal Network a single temporal hyperarc constraint may be defined as a set of two or more maximum delay constraints which is satisfied when at least one of these dela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03974","kind":"arxiv","version":3},"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":"1503.03974","created_at":"2026-05-18T00:48:10.147609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03974v3","created_at":"2026-05-18T00:48:10.147609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03974","created_at":"2026-05-18T00:48:10.147609+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4VBFJYCOLUC","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4VBFJYCOLUCK65Y","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4VBFJYC","created_at":"2026-05-18T12:29:22.688609+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/G4VBFJYCOLUCK65YUFMHMRPWOX","json":"https://pith.science/pith/G4VBFJYCOLUCK65YUFMHMRPWOX.json","graph_json":"https://pith.science/api/pith-number/G4VBFJYCOLUCK65YUFMHMRPWOX/graph.json","events_json":"https://pith.science/api/pith-number/G4VBFJYCOLUCK65YUFMHMRPWOX/events.json","paper":"https://pith.science/paper/G4VBFJYC"},"agent_actions":{"view_html":"https://pith.science/pith/G4VBFJYCOLUCK65YUFMHMRPWOX","download_json":"https://pith.science/pith/G4VBFJYCOLUCK65YUFMHMRPWOX.json","view_paper":"https://pith.science/paper/G4VBFJYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03974&json=true","fetch_graph":"https://pith.science/api/pith-number/G4VBFJYCOLUCK65YUFMHMRPWOX/graph.json","fetch_events":"https://pith.science/api/pith-number/G4VBFJYCOLUCK65YUFMHMRPWOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4VBFJYCOLUCK65YUFMHMRPWOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4VBFJYCOLUCK65YUFMHMRPWOX/action/storage_attestation","attest_author":"https://pith.science/pith/G4VBFJYCOLUCK65YUFMHMRPWOX/action/author_attestation","sign_citation":"https://pith.science/pith/G4VBFJYCOLUCK65YUFMHMRPWOX/action/citation_signature","submit_replication":"https://pith.science/pith/G4VBFJYCOLUCK65YUFMHMRPWOX/action/replication_record"}},"created_at":"2026-05-18T00:48:10.147609+00:00","updated_at":"2026-05-18T00:48:10.147609+00:00"}