{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BWPXNXE2BAKCR6FUU2BW4WB75Z","short_pith_number":"pith:BWPXNXE2","schema_version":"1.0","canonical_sha256":"0d9f76dc9a081428f8b4a6836e583fee74777b1e665dbf5b29afe79617411796","source":{"kind":"arxiv","id":"1810.03906","version":2},"attestation_state":"computed","paper":{"title":"Conjectures about Traffic Light Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"Guy Louchard, Steven Finch","submitted_at":"2018-10-09T10:59:01Z","abstract_excerpt":"In discrete time, $\\ell$-blocks of red lights are separated by $\\ell$-blocks of green lights. Cars arrive at random. The maximum line length of idle cars is fully understood for $\\ell = 1$, but only partially for $2 \\leq \\ell \\leq 3$."},"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":"1810.03906","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2018-10-09T10:59:01Z","cross_cats_sorted":[],"title_canon_sha256":"144f773b70821ef974788c5900459a5175b428fcb6ae37c47a6538d54d342477","abstract_canon_sha256":"a1a26da1b71d18f4ed7e3d2d4825458385b8a3002ef1fae18149020dd0a2446e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:52.776157Z","signature_b64":"9+b1m9dJ8R8vblKPKV8Xk/QgZS2ZUE8ZQocjpeMdusfLMnLHhDAP68NHf2NFnzyvHEE5dcdtMG036437LWjNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9f76dc9a081428f8b4a6836e583fee74777b1e665dbf5b29afe79617411796","last_reissued_at":"2026-05-18T00:01:52.775623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:52.775623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conjectures about Traffic Light Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"Guy Louchard, Steven Finch","submitted_at":"2018-10-09T10:59:01Z","abstract_excerpt":"In discrete time, $\\ell$-blocks of red lights are separated by $\\ell$-blocks of green lights. Cars arrive at random. The maximum line length of idle cars is fully understood for $\\ell = 1$, but only partially for $2 \\leq \\ell \\leq 3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03906","kind":"arxiv","version":2},"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":"1810.03906","created_at":"2026-05-18T00:01:52.775697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03906v2","created_at":"2026-05-18T00:01:52.775697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03906","created_at":"2026-05-18T00:01:52.775697+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWPXNXE2BAKC","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWPXNXE2BAKCR6FU","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWPXNXE2","created_at":"2026-05-18T12:32:16.446611+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/BWPXNXE2BAKCR6FUU2BW4WB75Z","json":"https://pith.science/pith/BWPXNXE2BAKCR6FUU2BW4WB75Z.json","graph_json":"https://pith.science/api/pith-number/BWPXNXE2BAKCR6FUU2BW4WB75Z/graph.json","events_json":"https://pith.science/api/pith-number/BWPXNXE2BAKCR6FUU2BW4WB75Z/events.json","paper":"https://pith.science/paper/BWPXNXE2"},"agent_actions":{"view_html":"https://pith.science/pith/BWPXNXE2BAKCR6FUU2BW4WB75Z","download_json":"https://pith.science/pith/BWPXNXE2BAKCR6FUU2BW4WB75Z.json","view_paper":"https://pith.science/paper/BWPXNXE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03906&json=true","fetch_graph":"https://pith.science/api/pith-number/BWPXNXE2BAKCR6FUU2BW4WB75Z/graph.json","fetch_events":"https://pith.science/api/pith-number/BWPXNXE2BAKCR6FUU2BW4WB75Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWPXNXE2BAKCR6FUU2BW4WB75Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWPXNXE2BAKCR6FUU2BW4WB75Z/action/storage_attestation","attest_author":"https://pith.science/pith/BWPXNXE2BAKCR6FUU2BW4WB75Z/action/author_attestation","sign_citation":"https://pith.science/pith/BWPXNXE2BAKCR6FUU2BW4WB75Z/action/citation_signature","submit_replication":"https://pith.science/pith/BWPXNXE2BAKCR6FUU2BW4WB75Z/action/replication_record"}},"created_at":"2026-05-18T00:01:52.775697+00:00","updated_at":"2026-05-18T00:01:52.775697+00:00"}