{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HQ3GSYSOY5CCRSBA5XTJVGI7AG","short_pith_number":"pith:HQ3GSYSO","schema_version":"1.0","canonical_sha256":"3c3669624ec74428c820ede69a991f01aa371f0b65f765055beca4f55e921b12","source":{"kind":"arxiv","id":"1210.6012","version":1},"attestation_state":"computed","paper":{"title":"A recursive equations based representation for the $G/G/m$ queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikolai Krivulin","submitted_at":"2012-10-22T19:27:17Z","abstract_excerpt":"New recursive equations designed for the G/G/m queue are presented. These equations describe the queue in terms of recursions for the arrival and departure times of customers, and involve only the operations of maximum, minimum and addition."},"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":"1210.6012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-22T19:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"a6878314705b0db89fc94ef05f3cf715ce4ad3fe78802497fe445ea6a6a70eab","abstract_canon_sha256":"d318ddc73970c6cae5dcd89c281ff4936841ded1dc0544c13c636c1a70b265f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:34.499853Z","signature_b64":"HAaBsER+6Dv9SYD+1BgtR5lmXKNl6OX4BzPaQCilq3NYMA8nNoBiTeRUZSLbtSp71UFpPjySsGPQzT9hZQLPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3669624ec74428c820ede69a991f01aa371f0b65f765055beca4f55e921b12","last_reissued_at":"2026-05-18T03:42:34.498610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:34.498610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A recursive equations based representation for the $G/G/m$ queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikolai Krivulin","submitted_at":"2012-10-22T19:27:17Z","abstract_excerpt":"New recursive equations designed for the G/G/m queue are presented. These equations describe the queue in terms of recursions for the arrival and departure times of customers, and involve only the operations of maximum, minimum and addition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6012","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":"1210.6012","created_at":"2026-05-18T03:42:34.499135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6012v1","created_at":"2026-05-18T03:42:34.499135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6012","created_at":"2026-05-18T03:42:34.499135+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQ3GSYSOY5CC","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQ3GSYSOY5CCRSBA","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQ3GSYSO","created_at":"2026-05-18T12:27:09.501522+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/HQ3GSYSOY5CCRSBA5XTJVGI7AG","json":"https://pith.science/pith/HQ3GSYSOY5CCRSBA5XTJVGI7AG.json","graph_json":"https://pith.science/api/pith-number/HQ3GSYSOY5CCRSBA5XTJVGI7AG/graph.json","events_json":"https://pith.science/api/pith-number/HQ3GSYSOY5CCRSBA5XTJVGI7AG/events.json","paper":"https://pith.science/paper/HQ3GSYSO"},"agent_actions":{"view_html":"https://pith.science/pith/HQ3GSYSOY5CCRSBA5XTJVGI7AG","download_json":"https://pith.science/pith/HQ3GSYSOY5CCRSBA5XTJVGI7AG.json","view_paper":"https://pith.science/paper/HQ3GSYSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6012&json=true","fetch_graph":"https://pith.science/api/pith-number/HQ3GSYSOY5CCRSBA5XTJVGI7AG/graph.json","fetch_events":"https://pith.science/api/pith-number/HQ3GSYSOY5CCRSBA5XTJVGI7AG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQ3GSYSOY5CCRSBA5XTJVGI7AG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQ3GSYSOY5CCRSBA5XTJVGI7AG/action/storage_attestation","attest_author":"https://pith.science/pith/HQ3GSYSOY5CCRSBA5XTJVGI7AG/action/author_attestation","sign_citation":"https://pith.science/pith/HQ3GSYSOY5CCRSBA5XTJVGI7AG/action/citation_signature","submit_replication":"https://pith.science/pith/HQ3GSYSOY5CCRSBA5XTJVGI7AG/action/replication_record"}},"created_at":"2026-05-18T03:42:34.499135+00:00","updated_at":"2026-05-18T03:42:34.499135+00:00"}