{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XT5VXJ4M6PKTUXZQKGGQBDCTNE","short_pith_number":"pith:XT5VXJ4M","schema_version":"1.0","canonical_sha256":"bcfb5ba78cf3d53a5f30518d008c53691c2b32c69cae81c73ab9726da1f15ff8","source":{"kind":"arxiv","id":"2606.28225","version":1},"attestation_state":"computed","paper":{"title":"Estimation--Prediction Tradeoff in Causal Probabilistic Temporal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.MA","cs.SI","cs.SY","eess.SY","math.IT"],"primary_cat":"cs.LG","authors_text":"Aniq Ur Rahman","submitted_at":"2026-06-26T16:13:48Z","abstract_excerpt":"Temporal link prediction is usually evaluated by predictive performance on unseen edges, but in probabilistic temporal graphs this criterion can conflate model error with irreducible uncertainty. We study this issue by characterising an inherent estimation--prediction tradeoff in binary logistic models where regimes that maximise Fisher information and improve parameter recoverability are also those with the highest entropy, making individual predictions intrinsically harder even under perfect parameter recovery. We propose a probabilistic causal framework for generating temporal graphs with t"},"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":"2606.28225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-26T16:13:48Z","cross_cats_sorted":["cs.IT","cs.MA","cs.SI","cs.SY","eess.SY","math.IT"],"title_canon_sha256":"9d3fcff4109b1ffd0d5de62dad9f3bb0f7723b348459e704bd0ed63aaf95db6a","abstract_canon_sha256":"3a403b2354e0e09e86babdc5e16370eb6a9812b85d123d235f4f47d7eb87e79e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:15:09.758928Z","signature_b64":"UTmowVoQTzE+oY+dvzudeR4jvudHgwdhUaltX0xtkHKLo9a+gDgqNC3W0G428XBfAEC8Z08zx/dcEK2W/s/BDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcfb5ba78cf3d53a5f30518d008c53691c2b32c69cae81c73ab9726da1f15ff8","last_reissued_at":"2026-06-29T01:15:09.758537Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:15:09.758537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimation--Prediction Tradeoff in Causal Probabilistic Temporal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.MA","cs.SI","cs.SY","eess.SY","math.IT"],"primary_cat":"cs.LG","authors_text":"Aniq Ur Rahman","submitted_at":"2026-06-26T16:13:48Z","abstract_excerpt":"Temporal link prediction is usually evaluated by predictive performance on unseen edges, but in probabilistic temporal graphs this criterion can conflate model error with irreducible uncertainty. We study this issue by characterising an inherent estimation--prediction tradeoff in binary logistic models where regimes that maximise Fisher information and improve parameter recoverability are also those with the highest entropy, making individual predictions intrinsically harder even under perfect parameter recovery. We propose a probabilistic causal framework for generating temporal graphs with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28225","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/2606.28225/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":"2606.28225","created_at":"2026-06-29T01:15:09.758598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28225v1","created_at":"2026-06-29T01:15:09.758598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28225","created_at":"2026-06-29T01:15:09.758598+00:00"},{"alias_kind":"pith_short_12","alias_value":"XT5VXJ4M6PKT","created_at":"2026-06-29T01:15:09.758598+00:00"},{"alias_kind":"pith_short_16","alias_value":"XT5VXJ4M6PKTUXZQ","created_at":"2026-06-29T01:15:09.758598+00:00"},{"alias_kind":"pith_short_8","alias_value":"XT5VXJ4M","created_at":"2026-06-29T01:15:09.758598+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/XT5VXJ4M6PKTUXZQKGGQBDCTNE","json":"https://pith.science/pith/XT5VXJ4M6PKTUXZQKGGQBDCTNE.json","graph_json":"https://pith.science/api/pith-number/XT5VXJ4M6PKTUXZQKGGQBDCTNE/graph.json","events_json":"https://pith.science/api/pith-number/XT5VXJ4M6PKTUXZQKGGQBDCTNE/events.json","paper":"https://pith.science/paper/XT5VXJ4M"},"agent_actions":{"view_html":"https://pith.science/pith/XT5VXJ4M6PKTUXZQKGGQBDCTNE","download_json":"https://pith.science/pith/XT5VXJ4M6PKTUXZQKGGQBDCTNE.json","view_paper":"https://pith.science/paper/XT5VXJ4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28225&json=true","fetch_graph":"https://pith.science/api/pith-number/XT5VXJ4M6PKTUXZQKGGQBDCTNE/graph.json","fetch_events":"https://pith.science/api/pith-number/XT5VXJ4M6PKTUXZQKGGQBDCTNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XT5VXJ4M6PKTUXZQKGGQBDCTNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XT5VXJ4M6PKTUXZQKGGQBDCTNE/action/storage_attestation","attest_author":"https://pith.science/pith/XT5VXJ4M6PKTUXZQKGGQBDCTNE/action/author_attestation","sign_citation":"https://pith.science/pith/XT5VXJ4M6PKTUXZQKGGQBDCTNE/action/citation_signature","submit_replication":"https://pith.science/pith/XT5VXJ4M6PKTUXZQKGGQBDCTNE/action/replication_record"}},"created_at":"2026-06-29T01:15:09.758598+00:00","updated_at":"2026-06-29T01:15:09.758598+00:00"}