{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XQ4RTWX7KNAA77YX3GCDQ4RIRF","short_pith_number":"pith:XQ4RTWX7","schema_version":"1.0","canonical_sha256":"bc3919daff53400fff17d984387228897686e338e56b2501d4e46cb4d32edbcb","source":{"kind":"arxiv","id":"1306.5526","version":1},"attestation_state":"computed","paper":{"title":"Programs in C++ for matrix computations in min plus algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"math.RA","authors_text":"Gheorghe Ivan, Mihai Ivan","submitted_at":"2013-06-24T07:33:16Z","abstract_excerpt":"The main purpose of this paper is to propose six programs in C++ for matrix computations and solving recurrent equations systems with entries in min plus algebra."},"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":"1306.5526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2013-06-24T07:33:16Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"765a1510b281d80feab550e94fa1f09472285c0762639e6f5037b9d40c343024","abstract_canon_sha256":"99c0575e26aa8a850c5ca2296bd182c177683e6757d7420c2521d885cd6c444e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:07.734351Z","signature_b64":"5WFCmXm4GbzpyT3AhJtR2iv55K4uG5CyeehMqwn5R9rResrJdjoKW7ZmFNQAaSu01Xngu1B9BP8okbcoxH9DDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc3919daff53400fff17d984387228897686e338e56b2501d4e46cb4d32edbcb","last_reissued_at":"2026-05-18T03:20:07.733704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:07.733704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Programs in C++ for matrix computations in min plus algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"math.RA","authors_text":"Gheorghe Ivan, Mihai Ivan","submitted_at":"2013-06-24T07:33:16Z","abstract_excerpt":"The main purpose of this paper is to propose six programs in C++ for matrix computations and solving recurrent equations systems with entries in min plus algebra."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5526","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":"1306.5526","created_at":"2026-05-18T03:20:07.733818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5526v1","created_at":"2026-05-18T03:20:07.733818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5526","created_at":"2026-05-18T03:20:07.733818+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQ4RTWX7KNAA","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQ4RTWX7KNAA77YX","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQ4RTWX7","created_at":"2026-05-18T12:28:06.772260+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/XQ4RTWX7KNAA77YX3GCDQ4RIRF","json":"https://pith.science/pith/XQ4RTWX7KNAA77YX3GCDQ4RIRF.json","graph_json":"https://pith.science/api/pith-number/XQ4RTWX7KNAA77YX3GCDQ4RIRF/graph.json","events_json":"https://pith.science/api/pith-number/XQ4RTWX7KNAA77YX3GCDQ4RIRF/events.json","paper":"https://pith.science/paper/XQ4RTWX7"},"agent_actions":{"view_html":"https://pith.science/pith/XQ4RTWX7KNAA77YX3GCDQ4RIRF","download_json":"https://pith.science/pith/XQ4RTWX7KNAA77YX3GCDQ4RIRF.json","view_paper":"https://pith.science/paper/XQ4RTWX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5526&json=true","fetch_graph":"https://pith.science/api/pith-number/XQ4RTWX7KNAA77YX3GCDQ4RIRF/graph.json","fetch_events":"https://pith.science/api/pith-number/XQ4RTWX7KNAA77YX3GCDQ4RIRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQ4RTWX7KNAA77YX3GCDQ4RIRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQ4RTWX7KNAA77YX3GCDQ4RIRF/action/storage_attestation","attest_author":"https://pith.science/pith/XQ4RTWX7KNAA77YX3GCDQ4RIRF/action/author_attestation","sign_citation":"https://pith.science/pith/XQ4RTWX7KNAA77YX3GCDQ4RIRF/action/citation_signature","submit_replication":"https://pith.science/pith/XQ4RTWX7KNAA77YX3GCDQ4RIRF/action/replication_record"}},"created_at":"2026-05-18T03:20:07.733818+00:00","updated_at":"2026-05-18T03:20:07.733818+00:00"}