{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4AUNDOPY2AZAUEHIV7NLAAPGWY","short_pith_number":"pith:4AUNDOPY","schema_version":"1.0","canonical_sha256":"e028d1b9f8d0320a10e8afdab001e6b61419007b50f778cd6862087345dc8bc0","source":{"kind":"arxiv","id":"1510.00843","version":1},"attestation_state":"computed","paper":{"title":"The Bruss-Robertson Inequality: Elaborations, Extensions, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"J. Michael Steele","submitted_at":"2015-10-03T16:16:52Z","abstract_excerpt":"The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the summands nor requires the equality of their marginal distributions. A review is also given of the applications of the Bruss-Robertson inequality, especially the applications to problems of combinatorial optimization such as the sequential knapsack problem and the sequential monotone subsequence selection problem."},"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":"1510.00843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-03T16:16:52Z","cross_cats_sorted":[],"title_canon_sha256":"7498ddc5dbfe8cd5f5c6a511d0540a6a4e8baeb01affba8b4cbd61d549765a29","abstract_canon_sha256":"83f7197f04f72b63d9832126273deb48605d874222e564b13563b818d8efee1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:05.491360Z","signature_b64":"5QpIY2h9JaoG2mnQ+pCSc5js1NNRdqmgdcLD/6hAJRWmjXi2HeNpxOQv3T/sjXDXwamtjZ41EHIUFtEPIVQWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e028d1b9f8d0320a10e8afdab001e6b61419007b50f778cd6862087345dc8bc0","last_reissued_at":"2026-05-18T01:31:05.490620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:05.490620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Bruss-Robertson Inequality: Elaborations, Extensions, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"J. Michael Steele","submitted_at":"2015-10-03T16:16:52Z","abstract_excerpt":"The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the summands nor requires the equality of their marginal distributions. A review is also given of the applications of the Bruss-Robertson inequality, especially the applications to problems of combinatorial optimization such as the sequential knapsack problem and the sequential monotone subsequence selection problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00843","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":"1510.00843","created_at":"2026-05-18T01:31:05.490734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00843v1","created_at":"2026-05-18T01:31:05.490734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00843","created_at":"2026-05-18T01:31:05.490734+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AUNDOPY2AZA","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AUNDOPY2AZAUEHI","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AUNDOPY","created_at":"2026-05-18T12:29:05.191682+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/4AUNDOPY2AZAUEHIV7NLAAPGWY","json":"https://pith.science/pith/4AUNDOPY2AZAUEHIV7NLAAPGWY.json","graph_json":"https://pith.science/api/pith-number/4AUNDOPY2AZAUEHIV7NLAAPGWY/graph.json","events_json":"https://pith.science/api/pith-number/4AUNDOPY2AZAUEHIV7NLAAPGWY/events.json","paper":"https://pith.science/paper/4AUNDOPY"},"agent_actions":{"view_html":"https://pith.science/pith/4AUNDOPY2AZAUEHIV7NLAAPGWY","download_json":"https://pith.science/pith/4AUNDOPY2AZAUEHIV7NLAAPGWY.json","view_paper":"https://pith.science/paper/4AUNDOPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00843&json=true","fetch_graph":"https://pith.science/api/pith-number/4AUNDOPY2AZAUEHIV7NLAAPGWY/graph.json","fetch_events":"https://pith.science/api/pith-number/4AUNDOPY2AZAUEHIV7NLAAPGWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AUNDOPY2AZAUEHIV7NLAAPGWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AUNDOPY2AZAUEHIV7NLAAPGWY/action/storage_attestation","attest_author":"https://pith.science/pith/4AUNDOPY2AZAUEHIV7NLAAPGWY/action/author_attestation","sign_citation":"https://pith.science/pith/4AUNDOPY2AZAUEHIV7NLAAPGWY/action/citation_signature","submit_replication":"https://pith.science/pith/4AUNDOPY2AZAUEHIV7NLAAPGWY/action/replication_record"}},"created_at":"2026-05-18T01:31:05.490734+00:00","updated_at":"2026-05-18T01:31:05.490734+00:00"}