{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CNAJNT74RNM2G7SJX2NVOTD526","short_pith_number":"pith:CNAJNT74","schema_version":"1.0","canonical_sha256":"134096cffc8b59a37e49be9b574c7dd7a044b34d10be7a347a3b7e68ad46d30a","source":{"kind":"arxiv","id":"2501.04654","version":1},"attestation_state":"computed","paper":{"title":"Recorder: Comprehensive Parallel I/O Tracing and Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Chen Wang, Hariharan Devarajan, Izzet Yildirim, Kathryn Mohror, Marc Snir","submitted_at":"2025-01-08T18:07:12Z","abstract_excerpt":"This paper presents Recorder, a parallel I/O tracing tool designed to capture comprehensive I/O information on HPC applications. Recorder traces I/O calls across various I/O layers, storing all function parameters for each captured call. The volume of stored information scales linearly the application's execution scale. To address this, we present a sophisticated pattern-recognition-based compression algorithm. This algorithm identifies and compresses recurring I/O patterns both within individual processes and across multiple processes, significantly reducing space and time overheads. We evalu"},"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":"2501.04654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-01-08T18:07:12Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"02566d8909313da2c8a68a3aca3eafd4e31093b1d27d79c9f53828266b7fcfb9","abstract_canon_sha256":"a6bca9c2a5808ee9e5bb06043322bf671e6fad39d8801e85238d6fb347f38a39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:38.467987Z","signature_b64":"eH6EVJNd6FBnl4o9ws0FWew/GKQMz3fIYgvvtYnxzKVuh6jZg430JjKCEXt1QOltSsRJZ9vFc7ruUkkN7GuHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"134096cffc8b59a37e49be9b574c7dd7a044b34d10be7a347a3b7e68ad46d30a","last_reissued_at":"2026-07-05T09:58:38.467532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:38.467532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recorder: Comprehensive Parallel I/O Tracing and Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Chen Wang, Hariharan Devarajan, Izzet Yildirim, Kathryn Mohror, Marc Snir","submitted_at":"2025-01-08T18:07:12Z","abstract_excerpt":"This paper presents Recorder, a parallel I/O tracing tool designed to capture comprehensive I/O information on HPC applications. Recorder traces I/O calls across various I/O layers, storing all function parameters for each captured call. The volume of stored information scales linearly the application's execution scale. To address this, we present a sophisticated pattern-recognition-based compression algorithm. This algorithm identifies and compresses recurring I/O patterns both within individual processes and across multiple processes, significantly reducing space and time overheads. We evalu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04654","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/2501.04654/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":"2501.04654","created_at":"2026-07-05T09:58:38.467591+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04654v1","created_at":"2026-07-05T09:58:38.467591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04654","created_at":"2026-07-05T09:58:38.467591+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNAJNT74RNM2","created_at":"2026-07-05T09:58:38.467591+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNAJNT74RNM2G7SJ","created_at":"2026-07-05T09:58:38.467591+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNAJNT74","created_at":"2026-07-05T09:58:38.467591+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30197","citing_title":"FBench: A Flexible Benchmark for CFG-Based What-If Exploration of HPC I/O Patterns","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CNAJNT74RNM2G7SJX2NVOTD526","json":"https://pith.science/pith/CNAJNT74RNM2G7SJX2NVOTD526.json","graph_json":"https://pith.science/api/pith-number/CNAJNT74RNM2G7SJX2NVOTD526/graph.json","events_json":"https://pith.science/api/pith-number/CNAJNT74RNM2G7SJX2NVOTD526/events.json","paper":"https://pith.science/paper/CNAJNT74"},"agent_actions":{"view_html":"https://pith.science/pith/CNAJNT74RNM2G7SJX2NVOTD526","download_json":"https://pith.science/pith/CNAJNT74RNM2G7SJX2NVOTD526.json","view_paper":"https://pith.science/paper/CNAJNT74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04654&json=true","fetch_graph":"https://pith.science/api/pith-number/CNAJNT74RNM2G7SJX2NVOTD526/graph.json","fetch_events":"https://pith.science/api/pith-number/CNAJNT74RNM2G7SJX2NVOTD526/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNAJNT74RNM2G7SJX2NVOTD526/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNAJNT74RNM2G7SJX2NVOTD526/action/storage_attestation","attest_author":"https://pith.science/pith/CNAJNT74RNM2G7SJX2NVOTD526/action/author_attestation","sign_citation":"https://pith.science/pith/CNAJNT74RNM2G7SJX2NVOTD526/action/citation_signature","submit_replication":"https://pith.science/pith/CNAJNT74RNM2G7SJX2NVOTD526/action/replication_record"}},"created_at":"2026-07-05T09:58:38.467591+00:00","updated_at":"2026-07-05T09:58:38.467591+00:00"}