{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PF3ZAQFSGAHYNFKG6YRE2YDEUW","short_pith_number":"pith:PF3ZAQFS","schema_version":"1.0","canonical_sha256":"79779040b2300f869546f6224d6064a5bd3685e269a97b581b5834c29299fbd1","source":{"kind":"arxiv","id":"1205.4212","version":1},"attestation_state":"computed","paper":{"title":"Sample programs in C++ for matrix computations in max plus algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"cs.MS","authors_text":"Gheorghe Ivan, Mihai Ivan","submitted_at":"2012-05-17T07:32:57Z","abstract_excerpt":"The main purpose of this paper is to propose five programs in C++ for matrix computations and solving recurrent equations systems with entries in max 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":"1205.4212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2012-05-17T07:32:57Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"078fe300b46f723d79817fc3a01a801e20a7ff7c24e0a5d9980b7344a2cb094b","abstract_canon_sha256":"e6f0aa585be7d9e88bcb57a55d7eb1a61852732ab20ddf6f8834bd38afb83184"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:22.482405Z","signature_b64":"hMS2nCg+P9vLOV89dMpgq7QUOkr3Y6zB9CFm06I8r3ueIVDN3QIDkY7Y8uc43uNVUPZyFjw5Okw9TXAO7GZrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79779040b2300f869546f6224d6064a5bd3685e269a97b581b5834c29299fbd1","last_reissued_at":"2026-05-18T03:55:22.481641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:22.481641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample programs in C++ for matrix computations in max plus algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"cs.MS","authors_text":"Gheorghe Ivan, Mihai Ivan","submitted_at":"2012-05-17T07:32:57Z","abstract_excerpt":"The main purpose of this paper is to propose five programs in C++ for matrix computations and solving recurrent equations systems with entries in max plus algebra."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4212","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":"1205.4212","created_at":"2026-05-18T03:55:22.481768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4212v1","created_at":"2026-05-18T03:55:22.481768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4212","created_at":"2026-05-18T03:55:22.481768+00:00"},{"alias_kind":"pith_short_12","alias_value":"PF3ZAQFSGAHY","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PF3ZAQFSGAHYNFKG","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PF3ZAQFS","created_at":"2026-05-18T12:27:18.751474+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/PF3ZAQFSGAHYNFKG6YRE2YDEUW","json":"https://pith.science/pith/PF3ZAQFSGAHYNFKG6YRE2YDEUW.json","graph_json":"https://pith.science/api/pith-number/PF3ZAQFSGAHYNFKG6YRE2YDEUW/graph.json","events_json":"https://pith.science/api/pith-number/PF3ZAQFSGAHYNFKG6YRE2YDEUW/events.json","paper":"https://pith.science/paper/PF3ZAQFS"},"agent_actions":{"view_html":"https://pith.science/pith/PF3ZAQFSGAHYNFKG6YRE2YDEUW","download_json":"https://pith.science/pith/PF3ZAQFSGAHYNFKG6YRE2YDEUW.json","view_paper":"https://pith.science/paper/PF3ZAQFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4212&json=true","fetch_graph":"https://pith.science/api/pith-number/PF3ZAQFSGAHYNFKG6YRE2YDEUW/graph.json","fetch_events":"https://pith.science/api/pith-number/PF3ZAQFSGAHYNFKG6YRE2YDEUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PF3ZAQFSGAHYNFKG6YRE2YDEUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PF3ZAQFSGAHYNFKG6YRE2YDEUW/action/storage_attestation","attest_author":"https://pith.science/pith/PF3ZAQFSGAHYNFKG6YRE2YDEUW/action/author_attestation","sign_citation":"https://pith.science/pith/PF3ZAQFSGAHYNFKG6YRE2YDEUW/action/citation_signature","submit_replication":"https://pith.science/pith/PF3ZAQFSGAHYNFKG6YRE2YDEUW/action/replication_record"}},"created_at":"2026-05-18T03:55:22.481768+00:00","updated_at":"2026-05-18T03:55:22.481768+00:00"}