{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S7LP72H6OJ2PMAAHBFP3JZF4QR","short_pith_number":"pith:S7LP72H6","schema_version":"1.0","canonical_sha256":"97d6ffe8fe7274f60007095fb4e4bc8470fb10b99964fa528f72ef987798cfd7","source":{"kind":"arxiv","id":"2503.15771","version":1},"attestation_state":"computed","paper":{"title":"Recognizing and Realizing Temporal Reachability Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nils Morawietz, Othon Michail, Thomas Erlebach","submitted_at":"2025-03-20T01:07:39Z","abstract_excerpt":"A temporal graph $\\mathcal{G}=(G,\\lambda)$ can be represented by an underlying graph $G=(V,E)$ together with a function $\\lambda$ that assigns to each edge $e\\in E$ the set of time steps during which $e$ is present. The reachability graph of $\\mathcal{G}$ is the directed graph $D=(V,A)$ with $(u,v)\\in A$ if only if there is a temporal path from $u$ to $v$. We study the Reachability Graph Realizability (RGR) problem that asks whether a given directed graph $D=(V,A)$ is the reachability graph of some temporal graph. The question can be asked for undirected or directed temporal graphs, for reacha"},"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":"2503.15771","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-03-20T01:07:39Z","cross_cats_sorted":[],"title_canon_sha256":"d1663deaead6ed4fc524d336a25061b7e0e793522e135795e25e93a8a2f1aa76","abstract_canon_sha256":"84f7666bfa853a120e6e8296b470d52d4f558cf9bf1610122461ad8a13d0132c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:35:58.473631Z","signature_b64":"Hwp2uFjfS4C+NuJPOFHi9mtAYaq8wSEYJROkjyoJc/YPXC+1Y9KGGGHimyzRoVZNNdu98bcMb3uGvrIJ5haQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97d6ffe8fe7274f60007095fb4e4bc8470fb10b99964fa528f72ef987798cfd7","last_reissued_at":"2026-07-05T10:35:58.472759Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:35:58.472759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognizing and Realizing Temporal Reachability Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nils Morawietz, Othon Michail, Thomas Erlebach","submitted_at":"2025-03-20T01:07:39Z","abstract_excerpt":"A temporal graph $\\mathcal{G}=(G,\\lambda)$ can be represented by an underlying graph $G=(V,E)$ together with a function $\\lambda$ that assigns to each edge $e\\in E$ the set of time steps during which $e$ is present. The reachability graph of $\\mathcal{G}$ is the directed graph $D=(V,A)$ with $(u,v)\\in A$ if only if there is a temporal path from $u$ to $v$. We study the Reachability Graph Realizability (RGR) problem that asks whether a given directed graph $D=(V,A)$ is the reachability graph of some temporal graph. The question can be asked for undirected or directed temporal graphs, for reacha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.15771","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.15771/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.15771","created_at":"2026-07-05T10:35:58.472868+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.15771v1","created_at":"2026-07-05T10:35:58.472868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.15771","created_at":"2026-07-05T10:35:58.472868+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7LP72H6OJ2P","created_at":"2026-07-05T10:35:58.472868+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7LP72H6OJ2PMAAH","created_at":"2026-07-05T10:35:58.472868+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7LP72H6","created_at":"2026-07-05T10:35:58.472868+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.14258","citing_title":"Temporal Graph Realization With Bounded Stretch","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S7LP72H6OJ2PMAAHBFP3JZF4QR","json":"https://pith.science/pith/S7LP72H6OJ2PMAAHBFP3JZF4QR.json","graph_json":"https://pith.science/api/pith-number/S7LP72H6OJ2PMAAHBFP3JZF4QR/graph.json","events_json":"https://pith.science/api/pith-number/S7LP72H6OJ2PMAAHBFP3JZF4QR/events.json","paper":"https://pith.science/paper/S7LP72H6"},"agent_actions":{"view_html":"https://pith.science/pith/S7LP72H6OJ2PMAAHBFP3JZF4QR","download_json":"https://pith.science/pith/S7LP72H6OJ2PMAAHBFP3JZF4QR.json","view_paper":"https://pith.science/paper/S7LP72H6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.15771&json=true","fetch_graph":"https://pith.science/api/pith-number/S7LP72H6OJ2PMAAHBFP3JZF4QR/graph.json","fetch_events":"https://pith.science/api/pith-number/S7LP72H6OJ2PMAAHBFP3JZF4QR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7LP72H6OJ2PMAAHBFP3JZF4QR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7LP72H6OJ2PMAAHBFP3JZF4QR/action/storage_attestation","attest_author":"https://pith.science/pith/S7LP72H6OJ2PMAAHBFP3JZF4QR/action/author_attestation","sign_citation":"https://pith.science/pith/S7LP72H6OJ2PMAAHBFP3JZF4QR/action/citation_signature","submit_replication":"https://pith.science/pith/S7LP72H6OJ2PMAAHBFP3JZF4QR/action/replication_record"}},"created_at":"2026-07-05T10:35:58.472868+00:00","updated_at":"2026-07-05T10:35:58.472868+00:00"}